Sciweavers

1612 search results - page 150 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
TSP
2010
14 years 11 months ago
On scalable distributed coding of correlated sources
Abstract--This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit, a setting typically encountered in sensor n...
Ankur Saxena, Kenneth Rose
EUROPAR
2009
Springer
15 years 11 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ICML
2010
IEEE
15 years 6 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 5 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ATAL
2008
Springer
15 years 7 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein