Sciweavers

441 search results - page 63 / 89
» Query expansion using random walk models
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 9 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
CLEF
2010
Springer
13 years 11 months ago
UESTC at ImageCLEF 2010 Medical Retrieval Task
This paper presents the UESTC contribution to the ImageCLEF 2010 medical retrieval task. For ad-hoc retrieval and case-based retrieval, we only use text information, and propose a ...
Hong Wu, Changjun Hu, Sikun Chen
VIS
2007
IEEE
101views Visualization» more  VIS 2007»
14 years 11 months ago
Random-Accessible Compressed Triangle Meshes
With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a r...
Sung-Eui Yoon, Peter Lindstrom
COMAD
2008
13 years 11 months ago
Exploiting Asynchronous IO using the Asynchronous Iterator Model
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issu...
Suresh Iyengar, S. Sudarshan, Santosh Kumar 0002, ...
CIKM
2005
Springer
14 years 3 months ago
Implicit user modeling for personalized search
Information retrieval systems (e.g., web search engines) are critical for overcoming information overload. A major deficiency of existing retrieval systems is that they generally...
Xuehua Shen, Bin Tan, ChengXiang Zhai