Sciweavers

4536 search results - page 412 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICALP
1994
Springer
15 years 11 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
VLDB
1989
ACM
104views Database» more  VLDB 1989»
15 years 11 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi
UAI
1998
15 years 8 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 11 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 6 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