226 search results - page 5 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
ADMA
2005
Springer
13 years 9 months ago
2005
Springer
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper addresses the problem of robust optimal multi-view triangulation. We propose an abstract framework, as well as a practical algorithm, which finds the best 3D reconstruc...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
ALGORITHMICA
2006
13 years 7 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
SPAA
2003
ACM
14 years 18 days ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...