Sciweavers

1088 search results - page 101 / 218
» Probabilistic query expansion using query logs
Sort
View
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 3 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
FOCS
2008
IEEE
14 years 3 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
PVLDB
2010
102views more  PVLDB 2010»
13 years 7 months ago
SQL QueRIE Recommendations
This demonstration presents QueRIE, a recommender system that supports interactive database exploration. This system aims at assisting non-expert users of scientific databases by...
Javad Akbarnejad, Gloria Chatzopoulou, Magdalini E...
CORR
2011
Springer
209views Education» more  CORR 2011»
13 years 4 months ago
An Empirical Study of Real-World SPARQL Queries
Understanding how users tailor their SPARQL queries is crucial when designing query evaluation engines or fine-tuning RDF stores with performance in mind. In this paper we analyz...
Mario Arias, Javier D. Fernández, Miguel A....
JAIR
2011
138views more  JAIR 2011»
13 years 4 months ago
Identifying Aspects for Web-Search Queries
Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effectiv...
Fei Wu, Jayant Madhavan, Alon Y. Halevy