20 papers:
- ICALP-v1-2015-BjorklundKKZ
- Spotting Trees with Few Leaves (AB, VK, LK, MZ), pp. 243–255.
- KDD-2015-OkumuraST #analysis #classification #incremental #linear #problem
- Quick Sensitivity Analysis for Incremental Data Modification and Its Application to Leave-one-out CV in Linear Classification Problems (SO, YS, IT), pp. 885–894.
- CSL-2015-GabbayGP
- Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes (MJG, DRG, DP), pp. 374–389.
- CHI-2013-0002CWO #community #lessons learnt
- Leaving the wild: lessons from community technology handovers (NT, KC, PCW, PO), pp. 1549–1558.
- CHI-2013-BaumerAKLSSW #case study #experience #facebook
- Limiting, leaving, and (re)lapsing: an exploration of facebook non-use practices and experiences (EPSB, PA, VDK, TCL, MES, VSS, KW), pp. 3257–3266.
- CSCW-2012-WangKL #health #online
- To stay or leave?: the relationship of emotional and informational support to commitment in online health support groups (YCW, RK, JML), pp. 833–842.
- CIKM-2012-DiriyeWBD #comprehension #predict #web
- Leaving so soon?: understanding and predicting web search abandonment rationales (AD, RW, GB, STD), pp. 1025–1034.
- CIKM-2011-LiuLH #bound #fault #kernel #learning
- Learning kernels with upper bounds of leave-one-out error (YL, SL, YH), pp. 2205–2208.
- MLDM-2011-LiTM #classification #hybrid #named #performance
- ACE-Cost: Acquisition Cost Efficient Classifier by Hybrid Decision Tree with Local SVM Leaves (LL, UT, NDM), pp. 60–74.
- WCRE-1999-RothlisbergerND99a #ide
- Autumn Leaves: Curing the Window Plague in IDEs (DR, ON, SD), pp. 237–246.
- ICML-2008-FrancLM #fault
- Stopping conditions for exact computation of leave-one-out error in support vector machines (VF, PL, KRM), pp. 328–335.
- ICPR-2008-MaZLZX #modelling
- Image-based plant modeling by knowing leaves from their apexes (WM, HZ, JL, XZ, BX), pp. 1–4.
- DocEng-2005-Bulterman #documentation #nondeterminism
- Engineering information in documents: leaving room for uncertainty (DCAB), p. 94.
- ICPR-v3-2004-YingK #evaluation #performance
- Fast Leave-One-Out Evaluation and Improvement on Inference for LS-SVMs (ZY, KCK), pp. 494–497.
- PPoPP-2003-TauraKEY #named #parallel #programming
- Phoenix: a parallel programming model for accommodating dynamically joining/leaving resources (KT, KK, TE, AY), pp. 216–229.
- ICALP-1997-BassinoBP #sequence
- Enumerative Sequences of Leaves in Rational Trees (FB, MPB, DP), pp. 76–86.
- ICML-1997-Torgo #functional #modelling
- Functional Models for Regression Tree Leaves (LT), pp. 385–393.
- HPDC-1996-AlmerothA #behaviour #modelling #multi
- Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone (KCA, MHA), pp. 209–216.
- ICML-1995-Lubinsky #classification #consistency #performance #using
- Increasing the Performance and Consistency of Classification Trees by Using the Accuracy Criterion at the Leaves (DJL), pp. 371–377.
- PODS-1991-Matsliach #analysis #multi #performance
- Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions (GM), pp. 164–180.