Sciweavers

472 search results - page 29 / 95
» Symbolic range propagation
Sort
View
PLDI
2010
ACM
14 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
JSAC
2006
97views more  JSAC 2006»
13 years 10 months ago
Distributed Turbo Coding With Soft Information Relaying in Multihop Relay Networks
It has been shown that distributed turbo coding (DTC) can approach the capacity of a wireless relay network. In the existing DTC schemes, it is usually assumed that error-free deco...
Yonghui Li, Branka Vucetic, Tan F. Wong, Mischa Do...
PAMI
2010
188views more  PAMI 2010»
13 years 8 months ago
Spatial-Temporal Fusion for High Accuracy Depth Maps Using Dynamic MRFs
— Time-of-flight range sensors and passive stereo have complimentary characteristics in nature. To fuse them to get high accuracy depth maps varying over time, we extend traditi...
Jiejie Zhu, Liang Wang 0002, Jizhou Gao, Ruigang Y...
JMLR
2010
141views more  JMLR 2010»
13 years 4 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
VTC
2007
IEEE
14 years 4 months ago
A Novel Timing and Frequency Offset Estimation Scheme for OFDM Systems
— A novel structure of training symbol is proposed for orthogonal frequency division multiplexing (OFDM) systems. With the proposed training symbol, which has repeated sample blo...
Shun-Sheng Wang, Chih-Peng Li, Chin-Liang Wang