126 search results - page 15 / 26 » Lower Bounds for Set Intersection Queries |
174
click to vote
GIS
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
60
Voted
COLT
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
ALT
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
107
click to vote
WWW
2006
ACM
15 years 10 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...