Sciweavers

4541 search results - page 396 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
UAI
1998
15 years 6 months ago
Learning Mixtures of DAG Models
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...
Bo Thiesson, Christopher Meek, David Maxwell Chick...
ECOOP
1999
Springer
15 years 9 months ago
An Approach to Classify Semi-structured Objects
Several advanced applications, such as those dealing with the Web, need to handle data whose structure is not known a-priori. Such requirement severely limits the applicability of ...
Elisa Bertino, Giovanna Guerrini, Isabella Merlo, ...
IJHPCA
2007
88views more  IJHPCA 2007»
15 years 4 months ago
Scaling Properties of Common Statistical Operators for Gridded Datasets
An accurate cost-model that accounts for dataset size and structure can help optimize geoscience data analysis. We develop and apply a computational model to estimate data analysi...
Charles S. Zender, Harry Mangalam
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 5 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 5 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...