Sciweavers

140 search results - page 19 / 28
» Clustering via Matrix Powering
Sort
View
CPHYSICS
2008
96views more  CPHYSICS 2008»
13 years 11 months ago
Moment distributions of clusters and molecules in the adiabatic rotor model
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
G. E. Ballentine, G. F. Bertsch, N. Onishi, K. Yab...
ICS
2010
Tsinghua U.
14 years 8 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
NIPS
2001
14 years 5 days ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
WSOM
2009
Springer
14 years 5 months ago
Analytic Comparison of Self-Organising Maps
Abstract. SOMs have proven to be a very powerful tool for data analysis. However, comparing multiple SOMs trained on the same data set using different parameters or initialisation...
Rudolf Mayer, Robert Neumayer, Doris Baum, Andreas...
CCGRID
2005
IEEE
14 years 4 months ago
Dynamic load balancing experiments in a grid
Connected world-widely distributed computers and data systems establish a global source of processing power and data, called a grid. Key properties of a grid are the fact that com...
Menno Dobber, Ger Koole, Robert D. van der Mei