57 search results - page 9 / 12 » Redundancy in All Pairs Fast Marching Method |
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, an efficient method using various histogrambased (high-dimensional) image content descriptors for automatically classifying general color photos into relevant categ...
JMLR
2010
13 years 5 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
BMCBI
2010
13 years 7 months ago
2010
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
IJRR
2007
13 years 7 months ago
2007
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
CTRS
1990
13 years 11 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...