1177 search results - page 72 / 236 » Iterative methods for Robbins problems |
109
Voted
PAMI
2008
15 years 13 days ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
134
Voted
BCB
2010
14 years 7 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
118
Voted
ICCL
1998
IEEE
15 years 4 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
92
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we present an object tracking algorithm for the low-frame-rate video in which objects have fast motion. The conventional mean-shift tracking fails in case the reloc...