Sciweavers

5658 search results - page 11 / 1132
» An Efficient Counting Network
Sort
View
DCOSS
2008
Springer
13 years 11 months ago
Stochastic Counting in Sensor Networks, or: Noise Is Good
We propose a novel algorithm of counting indistinguishable objects by a collection of sensors. The information on multiple counting is recovered from the stochastic correlation pat...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung...
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 1 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
STOC
1991
ACM
167views Algorithms» more  STOC 1991»
14 years 1 months ago
Counting Networks and Multi-Processor Coordination
d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
James Aspnes, Maurice Herlihy, Nir Shavit
ICML
2008
IEEE
14 years 10 months ago
Semi-supervised learning of compact document representations with deep networks
Finding good representations of text documents is crucial in information retrieval and classification systems. Today the most popular document representation is based on a vector ...
Marc'Aurelio Ranzato, Martin Szummer
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 9 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani