Sciweavers

441 search results - page 31 / 89
» Query expansion using random walk models
Sort
View
CIKM
2010
Springer
13 years 8 months ago
Improving verbose queries using subset distribution
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
Xiaobing Xue, Samuel Huston, W. Bruce Croft
INFOCOM
2009
IEEE
14 years 4 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki
ICPR
2008
IEEE
14 years 4 months ago
Tracking across non-overlapping views via geometry
Tracking across non-overlapping camera views is still an unsolved problem. Appearance is a popular cue that does not work when the views are considerably different. This paper pro...
Roman P. Pflugfelder, Horst Bischof
FOCS
2006
IEEE
14 years 3 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
14 years 3 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee