3891 search results - page 181 / 779 » Query Models |
147
click to vote
CIKM
2007
Springer
16 years 13 days ago
2007
Springer
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
178
click to vote
GEOINFO
2003
15 years 7 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
175
click to vote
WEBDB
2004
Springer
15 years 11 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
162
click to vote
SMA
2006
ACM
16 years 6 days ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
153
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...