485 search results - page 24 / 97 » Iterative Bounding LAO |
109
Voted
CORR
2006
Springer
15 years 17 days ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
94
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
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 ...
128
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
120
Voted
CDC
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
76
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...