Sciweavers

17760 search results - page 133 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
TALG
2008
81views more  TALG 2008»
15 years 3 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
TCS
2008
15 years 3 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
15 years 3 months ago
Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
James A. Sellers, Andrew V. Sills, Gary L. Mullen
CDC
2010
IEEE
14 years 11 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
SIGMOD
2010
ACM
243views Database» more  SIGMOD 2010»
15 years 4 months ago
Non-homogeneous generalization in privacy preserving data publishing
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
Wai Kit Wong, Nikos Mamoulis, David Wai-Lok Cheung