Sciweavers

474 search results - page 61 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 10 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
CSE
2012
IEEE
12 years 3 months ago
Accelerating Quantum Monte Carlo Simulations of Real Materials on GPU Clusters
—Continuum quantum Monte Carlo (QMC) has proved to be an invaluable tool for predicting the properties of matter from fundamental principles. By solving the manybody Schr¨odinge...
Kenneth Esler, Jeongnim Kim, David M. Ceperley, Lu...
ECCV
2010
Springer
14 years 1 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
VISUALIZATION
2002
IEEE
14 years 25 days ago
Efficient Simplification of Point-Sampled Surfaces
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
Mark Pauly, Markus H. Gross, Leif Kobbelt
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 7 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin