Sciweavers

386 search results - page 58 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
DOLAP
2005
ACM
13 years 11 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
SIGMOD
2006
ACM
156views Database» more  SIGMOD 2006»
14 years 9 months ago
MauveDB: supporting model-based user views in database systems
Real-world data -- especially when generated by distributed measurement infrastructures such as sensor networks -- tends to be incomplete, imprecise, and erroneous, making it impo...
Amol Deshpande, Samuel Madden
VLDB
2004
ACM
257views Database» more  VLDB 2004»
14 years 2 months ago
BioPatentMiner: An Information Retrieval System for BioMedical Patents
Before undertaking new biomedical research, identifying concepts that have already been patented is essential. Traditional keyword based search on patent databases may not be su...
Sougata Mukherjea, Bhuvan Bamba
CIKM
2009
Springer
14 years 3 months ago
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...
Shariq Bashir, Andreas Rauber
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 9 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons