Sciweavers

225 search results - page 21 / 45
» Stably Computable Properties of Network Graphs
Sort
View
204
Voted
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 28 days ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
15 years 7 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo
122
Voted
ICALP
2009
Springer
16 years 1 months ago
Rumor Spreading in Social Networks
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...
97
Voted
ICASSP
2011
IEEE
14 years 4 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
WIOPT
2006
IEEE
15 years 6 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi