Sciweavers

416 search results - page 74 / 84
» Improving search relevance for implicitly temporal queries
Sort
View
WWW
2011
ACM
13 years 2 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
FOCS
2006
IEEE
14 years 1 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
CIKM
2011
Springer
12 years 7 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
MIR
2006
ACM
157views Multimedia» more  MIR 2006»
14 years 1 months ago
Generating summaries and visualization for large collections of geo-referenced photographs
We describe a framework for automatically selecting a summary set of photos from a large collection of geo-referenced photographs. Such large collections are inherently difficult ...
Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Dav...
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
13 years 11 months ago
Schema Mapping in P2P Networks Based on Classification and Probing
In this paper, we address the problems of adaptive schema mappings between different peers in peer-to-peer network and searching for interesting data residing at different peers ba...
Guoliang Li, Beng Chin Ooi, Bei Yu, Lizhu Zhou