Sciweavers

1729 search results - page 110 / 346
» Deterministic Expressions in C
Sort
View
PODC
2009
ACM
16 years 6 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
201
Voted
SIGMETRICS
2009
ACM
182views Hardware» more  SIGMETRICS 2009»
16 years 23 days ago
The age of gossip: spatial mean field regime
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
Augustin Chaintreau, Jean-Yves Le Boudec, Nikodin ...
ICALP
2010
Springer
15 years 11 months ago
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Amir Shpilka, Ilya Volkovich
CCR
2008
101views more  CCR 2008»
15 years 6 months ago
Empirical evaluation of hash functions for multipoint measurements
A broad spectrum of network measurement applications demand passive multipoint measurements in which data from multiple observation points has to be correlated. Examples are the p...
Christian Henke, Carsten Schmoll, Tanja Zseby
SIAMJO
2010
130views more  SIAMJO 2010»
15 years 1 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...