Sciweavers

467 search results - page 27 / 94
» Processing top k queries from samples
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 9 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
MM
2005
ACM
172views Multimedia» more  MM 2005»
14 years 2 months ago
Learning the semantics of multimedia queries and concepts from a small number of examples
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
Apostol Natsev, Milind R. Naphade, Jelena Tesic
CIVR
2007
Springer
112views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Canonical image selection from the web
The vast majority of the features used in today’s commercially deployed image search systems employ techniques that are largely indistinguishable from text-document search – t...
Yushi Jing, Shumeet Baluja, Henry A. Rowley
CIKM
2004
Springer
14 years 2 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera