2107 search results - page 5 / 422 » Computing Small Search Numbers in Linear Time |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Face detection systems have recently achieved high detection rates[11, 8, 5] and real-time performance[11]. However, these methods usually rely on a huge training database (around...
IBPRIA
2003
Springer
14 years 25 days ago
2003
Springer
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
GD
2003
Springer
14 years 25 days ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
CG
2006
Springer
13 years 11 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...