Sciweavers

278 search results - page 51 / 56
» Two Upper Bounds on the Chromatic Number
Sort
View
POPL
2009
ACM
14 years 8 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
ICC
2007
IEEE
154views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Adaptive Power Allocation for Wireless Relay Networks
— In this paper, we consider a 2-hop wireless diversity relay network. We explore transmit power allocation among the source and relays to maximize the received signal to noise r...
Yonghui Li, Branka Vucetic, Zhendong Zhou, Mischa ...
MOBICOM
2005
ACM
14 years 28 days ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal
COMPGEOM
2010
ACM
14 years 13 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski