Sciweavers

42 search results - page 8 / 9
» A unified approach to ranking in probabilistic databases
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
13 years 11 months ago
Anytime Measures for Top-k Algorithms
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
CIKM
2011
Springer
12 years 5 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 5 months ago
Multi-dimensional search for personal information management systems
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...
Amélie Marian, Christopher Peery, Thu D. Ng...
MM
2005
ACM
172views Multimedia» more  MM 2005»
13 years 11 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
VLDB
2009
ACM
159views Database» more  VLDB 2009»
14 years 5 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...