Sciweavers

7228 search results - page 1191 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
15 years 11 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
15 years 11 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
POPL
2007
ACM
15 years 11 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
SIGMOD
2007
ACM
178views Database» more  SIGMOD 2007»
15 years 11 months ago
Quality is in the eye of the beholder: towards user-centric web-databases
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...
Huiming Qu, Jie Xu, Alexandros Labrinidis
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
15 years 11 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
« Prev « First page 1191 / 1446 Last » Next »