Sciweavers

1823 search results - page 104 / 365
» Distributed lossy averaging
Sort
View
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
16 years 4 months ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder

Lecture Notes
488views
17 years 3 months ago
Econometrics
These notes cover several topics such as Univariate Time Series Analysis, The Distribution of a Sample Average, Least Squares, Instrumental Variable Method, Simulating the Finite S...
Paul Söderlind
CVPR
2006
IEEE
16 years 6 months ago
Affine Invariance Revisited
This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations ar...
Evgeni Begelfor, Michael Werman
SODA
2001
ACM
80views Algorithms» more  SODA 2001»
15 years 5 months ago
On the discrete Bak-Sneppen model of self-organized criticality
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
Jérémy Barbay, Claire Kenyon
AMC
2007
114views more  AMC 2007»
15 years 4 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty