2880 search results - page 220 / 576 » Approximate Range Searching |
137
click to vote
EOR
2008
15 years 4 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
141
click to vote
TCS
2010
15 years 2 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
141
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
131
click to vote
DEXA
2006
Springer
15 years 6 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
169
Voted
MMM
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...