Sciweavers

12399 search results - page 2214 / 2480
» Deformable structural models
Sort
View
FCT
2005
Springer
15 years 10 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
139
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
154
Voted
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 10 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
SIGIR
2004
ACM
15 years 10 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
WIDM
2004
ACM
15 years 10 months ago
User evaluation of the NASA technical report server recommendation service
We present the user evaluation of two recommendation server methodologies implemented for the NASA Technical Report Server (NTRS). One methodology for generating recommendations u...
Michael L. Nelson, Johan Bollen, JoAnne R. Calhoun...
« Prev « First page 2214 / 2480 Last » Next »