11212 search results - page 304 / 2243 » Semi-persistent Data Structures |
186
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
190
click to vote
CCCG
2008
15 years 8 months ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
168
click to vote
ENTCS
2006
15 years 6 months ago
2006
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
162
click to vote
JMLR
2010
15 years 1 months ago
2010
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...