Sciweavers

2822 search results - page 252 / 565
» Global Optimization of Histograms
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira
CEC
2007
IEEE
16 years 28 days ago
Improving generalization capability of neural networks based on simulated annealing
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
Yeejin Lee, Jong-Seok Lee, Sun-Young Lee, Cheol Ho...
ICNP
2007
IEEE
16 years 27 days ago
Lexicographic products in metarouting
— Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the ...
Alexander J. T. Gurney, Timothy G. Griffin
LCPC
2000
Springer
15 years 10 months ago
SmartApps: An Application Centric Approach to High Performance Computing
State-of-the-art run-time systems are a poor match to diverse, dynamic distributed applications because they are designed to provide support to a wide variety of applications, with...
Lawrence Rauchwerger, Nancy M. Amato, Josep Torrel...
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...