Sciweavers

1083 search results - page 107 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
16 years 6 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
DBWORKSHOPS
1992
15 years 7 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
VLDB
2004
ACM
98views Database» more  VLDB 2004»
15 years 11 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
CASCON
2006
210views Education» more  CASCON 2006»
15 years 7 months ago
Accelerating marching cubes with graphics hardware
For large data sets in medicine and science, efficient isosurface extraction and rendering is crucial for interactive visualization. Previous GPU acceleration techniques have been...
Gunnar Johansson, Hamish Carr
CIKM
1993
Springer
15 years 10 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe