Sciweavers

2924 search results - page 264 / 585
» Lower Bounds in Distributed Computing
Sort
View
ALGOSENSORS
2009
Springer
15 years 10 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
CORR
2006
Springer
145views Education» more  CORR 2006»
15 years 4 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
COMPGEOM
2010
ACM
15 years 9 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
IPPS
2007
IEEE
15 years 10 months ago
Annotation Integration and Trade-off Analysis for Multimedia Applications
Multimedia applications for mobile devices, such as video/audio streaming, process streams of incoming data in a regular, predictable way. Content-aware optimizations through anno...
Radu Cornea, Alex Nicolau, Nikil Dutt
CCGRID
2002
IEEE
15 years 9 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin