Sciweavers

131 search results - page 26 / 27
» Hypergraphs with independent neighborhoods
Sort
View
SPAA
2006
ACM
15 years 5 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
161
Voted
CORR
2010
Springer
338views Education» more  CORR 2010»
14 years 11 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
IJCV
2006
161views more  IJCV 2006»
14 years 11 months ago
Discriminative Random Fields
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
Sanjiv Kumar, Martial Hebert
GLOBECOM
2008
IEEE
15 years 6 months ago
Optimal Location Updates in Mobile Ad Hoc Networks: A Separable Cost Case
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
Zhenzhen Ye, Alhussein A. Abouzeid
WINET
2011
14 years 6 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu