Sciweavers

1942 search results - page 114 / 389
» HINT: A new way to measure computer performance
Sort
View
NIPS
2004
15 years 7 months ago
Hierarchical Clustering of a Mixture Model
In this paper we propose an efficient algorithm for reducing a large mixture of Gaussians into a smaller mixture while still preserving the component structure of the original mod...
Jacob Goldberger, Sam T. Roweis
VRST
2003
ACM
15 years 11 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 10 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
CMG
1997
15 years 7 months ago
Capacity Planning in Distributed Environments
Capacity Planning has been a discipline practiced by IT since before the invention of the mainframe. It encompasses different measurement, analysis, modeling and reporting techniq...
Bernard Domanski
JCB
1998
129views more  JCB 1998»
15 years 6 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...