Sciweavers

1681 search results - page 278 / 337
» Speeding up keyword search for search engines
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 1 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 1 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik
SIGIR
2006
ACM
15 years 7 months ago
Improving the estimation of relevance models using large external corpora
Information retrieval algorithms leverage various collection statistics to improve performance. Because these statistics are often computed on a relatively small evaluation corpus...
Fernando Diaz, Donald Metzler
MM
2005
ACM
109views Multimedia» more  MM 2005»
15 years 7 months ago
Intention-based home video browsing
This demonstration presents an efficient home video browsing system from a novel viewpoint – capture intention. We extend our previous work to build up a comprehensive scheme to...
Tao Mei, Xian-Sheng Hua
SIGIR
2005
ACM
15 years 7 months ago
Question answering passage retrieval using dependency relations
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan, Tat-Sen...