Sciweavers

307 search results - page 49 / 62
» Finite locally-quasiprimitive graphs
Sort
View
SIPS
2008
IEEE
14 years 4 months ago
Scheduling of dataflow models within the Reconfigurable Video Coding framework
The upcoming Reconfigurable Video Coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and deco...
Jani Boutellier, Veeranjaneyulu Sadhanala, Christo...
PLILP
1997
Springer
14 years 2 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
14 years 1 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
14 years 1 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
FLAIRS
2001
13 years 11 months ago
Probabilistic Planning for Behavior-Based Robots
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
Amin Atrash, Sven Koenig