Sciweavers

189 search results - page 25 / 38
» Shortest Paths Without a Map
Sort
View
IFIPTCS
2010
13 years 5 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
MOBICOM
2003
ACM
14 years 1 months ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
13 years 12 months ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee
ICCV
2005
IEEE
14 years 1 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov
ICMCS
2007
IEEE
120views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Optimal Scheduling of Media Packets with Multiple Distortion Measures
Due to the increase in diversity of wireless devices, streaming media systems must be capable of serving multiple types of users. Scalable coding allows for adaptations without re...
Carri W. Chan, Nicholas Bambos, Susie Wee, John G....