Sciweavers

779 search results - page 52 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
DAWAK
2005
Springer
14 years 1 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
ICSE
2009
IEEE-ACM
14 years 2 months ago
Automatically capturing source code context of NL-queries for software maintenance and reuse
As software systems continue to grow and evolve, locating code for maintenance and reuse tasks becomes increasingly difficult. Existing static code search techniques using natura...
Emily Hill, Lori L. Pollock, K. Vijay-Shanker
CHI
2010
ACM
14 years 2 months ago
How does search behavior change as search becomes more difficult?
Search engines make it easy to check facts online, but finding some specific kinds of information sometimes proves to be difficult. We studied the behavioral signals that suggest ...
Anne Aula, Rehan M. Khan, Zhiwei Guan
AI
2008
Springer
14 years 2 months ago
A Frequency Mining-Based Algorithm for Re-ranking Web Search Engine Retrievals
Abstract. Conventional web search engines retrieve too many documents for the majority of the submitted queries; therefore, they possess a good recall, since there are far more pag...
M. Barouni-Ebrahimi, Ebrahim Bagheri, Ali A. Ghorb...
AAAI
2006
13 years 9 months ago
Explicit Passive Analysis in Electronic Catalogs
We consider example-critiquing systems that help people search for their most preferred item in a large catalog. We first analyze how such systems can help users in the framework ...
David Portabella Clotet, Martin Rajman