Sciweavers

929 search results - page 92 / 186
» Answering imprecise database queries: a novel approach
Sort
View
PVLDB
2010
91views more  PVLDB 2010»
14 years 10 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 3 days ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
99
Voted
CORR
2006
Springer
143views Education» more  CORR 2006»
14 years 12 months ago
A Knowledge-Based Approach for Selecting Information Sources
Through the Internet and the World-Wide Web, a vast number of information sources has become available, which offer information on various subjects by different providers, often i...
Thomas Eiter, Michael Fink, Hans Tompits
CIKM
2005
Springer
15 years 5 months ago
Novelty detection based on sentence level patterns
The detection of new information in a document stream is an important component of many potential applications. In this paper, a new novelty detection approach based on the identi...
Xiaoyan Li, W. Bruce Croft
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
14 years 11 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...