3946 search results - page 501 / 790 » The computational complexity of choice sets |
211
click to vote
IJFCS
2002
15 years 6 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
196
Voted
PAMI
2007
15 years 6 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
182
click to vote
PR
2007
15 years 6 months ago
2007
Detecting faces in images is a key step in numerous computer vision applications, such as face recognition or facial expression analysis. Automatic face detection is a difficult ...
166
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
187
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
This article introduces a best basis search algorithm in a nonstationary (NS) wavelet packets dictionary. It computes an optimized labeled quad-tree that indexes the filters used ...