Sciweavers

1022 search results - page 106 / 205
» New models and algorithms for programmable networks
Sort
View
117
Voted
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 2 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
ICPP
2006
IEEE
15 years 6 months ago
Social Welfare Based Routing in Ad hoc Networks
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
Mingming Lu, Jie Wu
118
Voted
IJCV
2002
188views more  IJCV 2002»
15 years 13 days ago
Scalable Extrinsic Calibration of Omni-Directional Image Networks
We describe a linear-time algorithm that recovers absolute camera orientations and positions, along with uncertainty estimates, for networks of terrestrial image nodes spanning hun...
Matthew E. Antone, Seth J. Teller
129
Voted
ICCCN
2007
IEEE
15 years 4 months ago
Localized and Configurable Topology Control in Lossy Wireless Sensor Networks
Wireless sensor networks (WSNs) introduce new challenges to topology control due to the prevalence of lossy links. We propose a new topology control formulation for lossy WSNs that...
Guoliang Xing, Chenyang Lu, Robert Pless
115
Voted
SIGGRAPH
1998
ACM
15 years 4 months ago
Subdivision Surfaces in Character Animation
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shap...
Tony DeRose, Michael Kass, Tien Truong