Sciweavers

667 search results - page 2 / 134
» Computably Based Locally Compact Spaces
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
CVPR
2004
IEEE
14 years 9 months ago
A Discriminative Feature Space for Detecting and Recognizing Faces
In this paper, we introduce a novel discriminative feature space which is efficient not only for face detection but also for recognition. The face representation is based on local...
Abdenour Hadid, Matti Pietikäinen, Timo Ahone...
DAC
2006
ACM
14 years 8 months ago
Unknown-tolerance analysis and test-quality control for test response compaction using space compactors
For a space compactor, degradation of fault detection capability caused by the masking effects from unknown values is much more serious than that caused by error masking (i.e. ali...
Mango Chia-Tso Chao, Kwang-Ting Cheng, Seongmoon W...
CCCG
2010
13 years 9 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich
MM
2010
ACM
462views Multimedia» more  MM 2010»
13 years 8 months ago
KPB-SIFT: a compact local feature descriptor
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and object recognition. However, such descriptors are typically of ...
Gangqiang Zhao, Ling Chen, Gencai Chen, Junsong Yu...