Sciweavers

1021 search results - page 77 / 205
» Fast Approximate PCPs
Sort
View
TIP
1998
162views more  TIP 1998»
15 years 2 months ago
Variational image segmentation using boundary functions
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
Gary A. Hewer, Charles S. Kenney, B. S. Manjunath
VISUALIZATION
1997
IEEE
15 years 7 months ago
Visualization of higher order singularities in vector fields
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...
Gerik Scheuermann, Hans Hagen, Heinz Krüger, ...
NIPS
2004
15 years 4 months ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
109
Voted
MJ
2006
138views more  MJ 2006»
15 years 2 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
COMGEO
1999
ACM
15 years 2 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland