11231 search results - page 455 / 2247 » Digging for Data Structures |
180
click to vote
DEBS
2007
ACM
15 years 9 months ago
2007
ACM
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
213
Voted
COMPGEOM
2008
ACM
15 years 9 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, ...
228
click to vote
CCCG
2008
15 years 9 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...
194
Voted
ENTCS
2006
15 years 7 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...