Sciweavers

425 search results - page 51 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
ICCV
2005
IEEE
14 years 2 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 3 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....
WIOPT
2005
IEEE
14 years 2 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
WSC
2004
13 years 10 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
ICPP
2000
IEEE
14 years 11 days ago
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
Adriana Iamnitchi, Ian T. Foster