Sciweavers

2560 search results - page 31 / 512
» Contributions to zero-sum problems
Sort
View
JCO
2007
128views more  JCO 2007»
13 years 7 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
PAMI
2010
122views more  PAMI 2010»
13 years 6 months ago
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
—This paper addresses pattern classification in the framework of domain adaptation by considering methods that solve problems in which training data are assumed to be available o...
Lorenzo Bruzzone, Mattia Marconcini
ICCV
2007
IEEE
14 years 10 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
ECCV
2006
Springer
14 years 9 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
IPPS
2009
IEEE
14 years 2 months ago
Ibis: Real-world problem solving using real-world grids
Ibis is an open source software framework that drastically simplifies the process of programming and deploying large-scale parallel and distributed grid applications. Ibis suppor...
Henri E. Bal, Niels Drost, Roelof Kemp, Jason Maas...