1632 search results - page 51 / 327 » Sublinear Time Algorithms for Metric Space Problems |
118
click to vote
MICAI
2004
Springer
15 years 8 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
128
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
151
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target em...
131
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Abstract. We propose a new tracking technique that is able to capture non-rigid motion by exploiting a space-time rank constraint. Most tracking methods use a prior model in order ...
129
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
Abstract— In the context of a design space exploration framework for supporting the platform-based design approach, we address the problem of robustness with respect to manufactu...