Sciweavers

1522 search results - page 163 / 305
» Distinctiveness of faces: A computational approach
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 1 months ago
Fast paths in large-scale dynamic road networks
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
Giacomo Nannicini, Philippe Baptiste, Gilles Barbi...
CVPR
2009
IEEE
15 years 5 months ago
Efficient image alignment using linear appearance models
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigentracking) are one of the most popular approaches to align templates ...
Jose Gonzalez-Mora, Nicolas Guil, Emilio L. Zapata...
143
Voted
AIMSA
2010
Springer
15 years 3 months ago
Towards Ontological Blending
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
Joana Hois, Oliver Kutz, Till Mossakowski, John A....
171
Voted
SIAMJO
2002
115views more  SIAMJO 2002»
15 years 1 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
100
Voted
PAMI
2010
112views more  PAMI 2010»
15 years 9 days ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum