Sciweavers

49 search results - page 4 / 10
» On Message Sequences for Incremental Network Computing
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
COMCOM
2006
80views more  COMCOM 2006»
13 years 7 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
SIGCOMM
2004
ACM
14 years 27 days ago
SPV: secure path vector routing for securing BGP
As our economy and critical infrastructure increasingly relies on the Internet, the insecurity of the underlying border gateway routing protocol (BGP) stands out as the Achilles h...
Yih-Chun Hu, Adrian Perrig, Marvin A. Sirbu
CVPR
2006
IEEE
14 years 9 months ago
Multi-Target Tracking - Linking Identities using Bayesian Network Inference
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
Peter Nillius, Josephine Sullivan, Stefan Carlsson
ICDCSW
2008
IEEE
14 years 1 months ago
Scalable AOI-Cast for Peer-to-Peer Networked Virtual Environments
Networked virtual environments (NVEs) are computergenerated virtual worlds where users interact by exchanging messages via network connections. Each NVE user often pays attention ...
Jehn-Ruey Jiang, Yu-Li Huang, Shun-Yun Hu