Sciweavers

621 search results - page 59 / 125
» Global partial orders from sequential data
Sort
View
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 2 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 2 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
SC
2000
ACM
15 years 2 months ago
Performance Modeling and Tuning of an Unstructured Mesh CFD Application
This paper describes performance tuning experiences with a three-dimensional unstructured grid Euler flow code from NASA, which we have reimplemented in the PETSc framework and p...
William Gropp, Dinesh K. Kaushik, David E. Keyes, ...
SAC
2008
ACM
14 years 9 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
EDBT
2004
ACM
268views Database» more  EDBT 2004»
15 years 10 months ago
DBDC: Density Based Distributed Clustering
Abstract. Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as m...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle