21 search results - page 1 / 5 » On lazy randomized incremental construction |
STOC
1994
ACM
13 years 11 months ago
1994
ACM
HASKELL
2009
ACM
14 years 1 months ago
2009
ACM
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
COMPGEOM
2003
ACM
14 years 18 days ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...