2100 search results - page 136 / 420 » Fundamentals of the problem |
192
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
174
click to vote
APSEC
2002
IEEE
15 years 11 months ago
2002
IEEE
One of the major problems in building large-scale distributed systems is to anticipate the performance of the eventual solution before it has been built. This problem is especiall...
140
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
198
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Optical flow estimation is a fundamental and ill-posed problem in computer vision. To recover a dense flow field, appropriate spatial constraints have to be enforced. Recent ad...
146
click to vote
JAR
2000
15 years 6 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...