Sciweavers

121 search results - page 18 / 25
» Bound Consistency for Binary Length-Lex Set Constraints
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 9 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
RTSS
1997
IEEE
13 years 11 months ago
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
Marco Caccamo, Giorgio C. Buttazzo
WACV
2012
IEEE
12 years 3 months ago
Tools for richer crowd source image annotations
Crowd-sourcing tools such as Mechanical Turk are popular for annotation of large scale image data sets. Typically, these annotations consist of bounding boxes or coarse outlines o...
Joshua Little, Austin Abrams, Robert Pless
GLOBECOM
2007
IEEE
14 years 1 months ago
Optimizing P2P Streaming Throughput Under Peer Churning
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
Yi Cui, Liang Dai, Yuan Xue