2107 search results - page 226 / 422 » Computing Small Search Numbers in Linear Time |
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
ICCV
2001
IEEE
14 years 11 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
WACV
2007
IEEE
14 years 3 months ago
2007
IEEE
Template matching is one of the key problems in computer vision and has been widely used in tracking, recognition and many other applications. Traditional methods are usually slow...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper examines the explicit communication characteristics of several sophisticated scientific applications, which, by themselves, constitute a representative suite of publicl...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
The use of asymmetric multi-core processors with onchip computational accelerators is becoming common in a variety of environments ranging from scientific computing to enterprise...