Sciweavers

585 search results - page 81 / 117
» Very Large Scale Information Retrieval
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 9 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
CIKM
2004
Springer
14 years 24 days ago
Taxonomy-driven computation of product recommendations
Recommender systems have been subject to an enormous rise in popularity and research interest over the last ten years. At the same time, very large taxonomies for product classifi...
Cai-Nicolas Ziegler, Georg Lausen, Lars Schmidt-Th...
CN
2010
136views more  CN 2010»
13 years 9 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
MIR
2004
ACM
101views Multimedia» more  MIR 2004»
14 years 2 months ago
Leveraging face recognition technology to find and organize photos
With digital still cameras, users can easily collect thousands of photos. We have created a photo management application with the goal of making photo organization and browsing si...
Andreas Girgensohn, John Adcock, Lynn Wilcox
SPIRE
2009
Springer
14 years 3 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro