130 search results - page 17 / 26 » Vertical Benchmarks for CAD |
114
Voted
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper proposes a novel algorithm to reconstruct a 3D surface from a calibrated set of images. In a first pass, it uses Scale Invariant Features Transform (SIFT) descriptor co...
ICML
2008
IEEE
16 years 17 days ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
106
click to vote
KDD
2002
ACM
16 years 5 days ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
AE
2007
Springer
15 years 6 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
120
click to vote
SLS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...