Sciweavers

1237 search results - page 135 / 248
» Partitions and the Fermi-Dirac Distribution
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
The little engine(s) that could: scaling online social networks
The difficulty of scaling Online Social Networks (OSNs) has introduced new system design challenges that has often caused costly re-architecting for services like Twitter and Face...
Josep M. Pujol, Vijay Erramilli, Georgos Siganos, ...
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
Exploratory Analysis of Functional Data via Clustering and Optimal Segmentation
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
Georges Hébrail, Bernard Hugueney, Yves Lec...
ML
2006
ACM
15 years 6 months ago
A Unified View on Clustering Binary Data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
RSA
2010
118views more  RSA 2010»
15 years 4 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
FOCS
2007
IEEE
16 years 21 days ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda