12194 search results - page 2187 / 2439 » Numberings Optimal for Learning |
179
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
204
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
202
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
267
click to vote
CAD
2011
Springer
15 years 1 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
182
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...