874 search results - page 68 / 175 » Faster Algorithms for Semi-Matching Problems |
CDES
2008
13 years 9 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
ALMOB
2006
13 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
IPL
2002
13 years 7 months ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Active contours were proposed by Kass et al. as a way to represent the contours of an image. Although the method is simple, one of its shortcomings is its inability to converge in...