Sciweavers

11580 search results - page 252 / 2316
» Communication vs. Computation
Sort
View
SAC
2005
ACM
15 years 10 months ago
Dynamic group communication in mobile peer-to-peer environments
This paper presents an approach to integrate publish/subscribe semantics with on-demand multicast in wireless ad hoc networks, providing dynamic group communication with fine-gra...
Eiko Yoneki, Jean Bacon
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 5 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
MOBIHOC
2002
ACM
16 years 4 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
JUCS
2010
109views more  JUCS 2010»
14 years 11 months ago
Semantics of Query-Driven Communication of Exact Values
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
Michal Konecný, Amin Farjudian
ICCV
2009
IEEE
1434views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Texel-based Texture Segmentation
Given an arbitrary image, our goal is to segment all distinct texture subimages. This is done by discovering distinct, cohesive groups of spatially repeating patterns, called tex...
Sinisa Todorovic, Narendra Ahuja