Sciweavers

142 search results - page 20 / 29
» Augmenting the connectivity of geometric graphs
Sort
View
AUIC
2006
IEEE
14 years 2 months ago
Fluid sketching of directed graphs
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
James Arvo, Kevin Novins
CVPR
2009
IEEE
14 years 3 months ago
Trajectory parsing by cluster sampling in spatio-temporal graph
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
Xiaobai Liu, Liang Lin, Song Chun Zhu, Hai Jin
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 2 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 3 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
TCOM
2010
109views more  TCOM 2010»
13 years 7 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik