Sciweavers

7758 search results - page 402 / 1552
» On the Number of Distributive Lattices
Sort
View
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 7 months ago
Statistical properties of subgroups of free groups
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...
Frédérique Bassino, Armando Martino,...
PUC
2008
137views more  PUC 2008»
15 years 6 months ago
Middleware support for the deployment of ubiquitous software components
A number of emerging distributed platforms include xed and robust workstations but, like dynamic and pervasive networks, are often built from mobile and resource-constrained device...
Didier Hoareau, Yves Mahéo
INFOCOM
2010
IEEE
15 years 5 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
DPD
2010
153views more  DPD 2010»
15 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
ICML
2004
IEEE
16 years 7 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh