Sciweavers

5962 search results - page 140 / 1193
» Efficient Clustering for Orders
Sort
View
HOTOS
2007
IEEE
15 years 10 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
JPDC
2006
100views more  JPDC 2006»
15 years 6 months ago
Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
ICCAD
2004
IEEE
147views Hardware» more  ICCAD 2004»
16 years 3 months ago
Interval-valued reduced order statistical interconnect modeling
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
James D. Ma, Rob A. Rutenbar
PG
1999
IEEE
15 years 10 months ago
Automatic Creation of Object Hierarchies for Radiosity Clustering
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...
Gordon Müller, Stephan Schäfer, Dieter W...
AAAI
2000
15 years 7 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen