485 search results - page 35 / 97 » Iterative Bounding LAO |
113
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
118
click to vote
MOC
2000
15 years 4 months ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
112
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
143
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
We present an approach to parallel variational optical flow computation on standard hardware by domain decomposition. Using an arbitrary partition of the image plane into rectangul...
160
click to vote
ISCAPDCS
2003
15 years 5 months ago
2003
In modern computer systems loops present a great deal of opportunities for increasing Instruction Level and Thread Level Parallelism. Loop unrolling is a technique used to obtain ...