Sciweavers

347 search results - page 64 / 70
» Foundations of Preferences in Database Systems
Sort
View
IJAR
2007
90views more  IJAR 2007»
13 years 9 months ago
An argumentation framework for merging conflicting knowledge bases
The problem of merging multiple sources of information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, e...
Leila Amgoud, Souhila Kaci
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 9 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 2 months ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 9 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 9 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang