2944 search results - page 417 / 589 » Improving Bound Propagation |
187
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
222
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We propose a framework that performs action recognition and identity maintenance of multiple targets simultaneously. Instead of first establishing tracks using an appearance mode...
204
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
271
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
200
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...