Sciweavers

1560 search results - page 218 / 312
» Robust Evolution Strategies
Sort
View
CN
2007
154views more  CN 2007»
15 years 4 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
JUCS
2008
155views more  JUCS 2008»
15 years 4 months ago
Combining Classifiers in the ROC-space for Off-line Signature Verification
: In this work we present a strategy for off-line signature verification. It takes into account a writer-independent model which reduces the pattern recognition problem to a 2-clas...
Luiz S. Oliveira, Edson J. R. Justino, Robert Sabo...
SIAMSC
2008
75views more  SIAMSC 2008»
15 years 4 months ago
Well-Balanced Time Implicit Formulation of Relaxation Schemes for the Euler Equations
We show how to derive time implicit formulations of relaxation schemes for the Euler equations for real materials in several space dimensions. In the fully time explicit setting, t...
Christophe Chalons, Frédéric Coquel,...
IJCV
2008
157views more  IJCV 2008»
15 years 4 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
ICCV
2009
IEEE
15 years 2 months ago
Matching as a non-cooperative game
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
Andrea Albarelli, Samuel Rota Bulò, Andrea ...