Sciweavers

2526 search results - page 184 / 506
» A New Algorithm for Answer Set Computation
Sort
View
202
Voted
CVPR
2010
IEEE
16 years 2 months ago
Online Multiple Instance Learning with No Regret
Multiple instance (MI) learning is a recent learning paradigm that is more flexible than standard supervised learning algorithms in the handling of label ambiguity. It has been u...
Li Mu, James Kwok, Lu Bao-liang
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 11 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 11 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
PVLDB
2010
120views more  PVLDB 2010»
15 years 4 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
CSR
2006
Springer
15 years 10 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan