Sciweavers

1199 search results - page 119 / 240
» Graph Theory
Sort
View
TCOM
2008
120views more  TCOM 2008»
15 years 4 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
SIVP
2010
118views more  SIVP 2010»
15 years 2 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray
SIAMCOMP
2011
14 years 6 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
RECSYS
2009
ACM
15 years 10 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
ATAL
2004
Springer
15 years 9 months ago
Merging Globally Rigid Formations of Mobile Autonomous Agents
This paper is concerned with merging globally rigid formations of mobile autonomous agents. A key element in all future multi-agent systems will be the role of sensor and communic...
Tolga Eren, Brian D. O. Anderson, Walter Whiteley,...