Sciweavers

272 search results - page 1 / 55
» Lazy tree splitting
Sort
View
ICFP
2010
ACM
13 years 6 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
CJ
2000
73views more  CJ 2000»
13 years 4 months ago
Fringe Analysis of 2-3 Trees with Lazy Parent Split
Antigoni Manousaka, Yannis Manolopoulos
ICML
2003
IEEE
14 years 5 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
ICML
1999
IEEE
14 years 5 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting

Publication
277views
15 years 4 months ago
LUGrid: Update-tolerant Grid-based Indexing for Moving Objects
Indexing moving objects is a fundamental issue in spatiotemporal databases. In this paper, we propose an adaptive Lazy-Update Grid-based index (LUGrid, for short) that minimizes th...
Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref