Sciweavers

5595 search results - page 339 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CSE
2012
IEEE
14 years 2 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...
INFOCOM
1998
IEEE
15 years 11 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar
ICML
2010
IEEE
15 years 7 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
IJCNN
2006
IEEE
16 years 23 days ago
Behavior of Fatigable SOM and its Application to Clustering
Abstract— The Self-Organizing Map (SOM) is popular algorithm for unsupervised learning and visualization introduced by Teuvo Kohonen. One of the most attractive applications of S...
Masato Tomita, Haruna Matsushita, Yoshifumi Nishio
ECCV
2010
Springer
15 years 12 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