Sciweavers

1971 search results - page 341 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
ICCV
2007
IEEE
16 years 22 days ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
ACCV
2007
Springer
16 years 18 days ago
Face Mis-alignment Analysis by Multiple-Instance Subspace
In this paper, we systematically study the effect of poorly registered faces on the training and inferring stages of traditional face recognition algorithms. We then propose a nov...
Zhiguo Li, Qingshan Liu, Dimitris N. Metaxas
IPMI
2005
Springer
15 years 12 months ago
Robust Active Appearance Model Matching
A novel robust active appearance model (AAM) matching algorithm is presented. The method consists of two main stages. First, initial residuals are clustered by a non parametric mea...
Reinhard Beichel, Horst Bischof, Franz Leberl, Mil...
CCGRID
2003
IEEE
15 years 11 months ago
Parallel Multi-Dimensional ROLAP Indexing
This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to imple...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
PVM
1998
Springer
15 years 10 months ago
Load Balancing for Network Based Multi-threaded Applications
In this paper we present Lbs, a load-management-system for network based concurrent computing. The system is built on Pt-Pvm, a library based on the PVM system. Pt-Pvm provides mes...
Oliver Krone, Martin Raab, Béat Hirsbrunner