Sciweavers

246 search results - page 13 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
WCNC
2010
IEEE
15 years 1 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
15 years 4 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...
CVPR
2009
IEEE
16 years 4 months ago
Understanding Videos, Constructing Plots - Learning a Visually Grounded Storyline Model from Annotated Videos
Analyzing videos of human activities involves not only recognizing actions (typically based on their appearances), but also determining the story/plot of the video. The storyline...
Abhinav Gupta (University of Maryland), Praveen Sr...
CORR
2006
Springer
145views Education» more  CORR 2006»
14 years 9 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...
JEC
2006
61views more  JEC 2006»
14 years 9 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha