Sciweavers

4007 search results - page 593 / 802
» Computation with imprecise probabilities
Sort
View
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
16 years 4 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
228
Voted
SIGMOD
2007
ACM
172views Database» more  SIGMOD 2007»
16 years 4 months ago
Auditing disclosure by relevance ranking
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
Rakesh Agrawal, Alexandre V. Evfimievski, Jerry Ki...
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
16 years 4 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 4 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 4 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul