Sciweavers

662 search results - page 31 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 7 months ago
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
Lyublena Antova, Christoph Koch, Dan Olteanu
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
ICML
2009
IEEE
14 years 8 months ago
Prototype vector machine for large scale semi-supervised learning
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
Kai Zhang, James T. Kwok, Bahram Parvin
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
TPDS
1998
112views more  TPDS 1998»
13 years 7 months ago
Parallel Computation in Biological Sequence Analysis
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
Tieng K. Yap, Ophir Frieder, Robert L. Martino