Sciweavers

2489 search results - page 424 / 498
» On the Subgroup Distance Problem
Sort
View
COR
2010
146views more  COR 2010»
14 years 12 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
COR
2010
166views more  COR 2010»
14 years 12 months ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 12 months ago
Natural pseudo-distance and optimal matching between reduced size functions
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
Michele d'Amico, Patrizio Frosini, Claudia Landi
CVIU
2010
130views more  CVIU 2010»
14 years 12 months ago
Discrete camera calibration from pixel streams
We consider the problem of estimating the relative orientation of a number of individual photocells -or pixels- that hold fixed relative positions. The photocells measure the inte...
Etienne Grossmann, José António Gasp...
DCG
2008
93views more  DCG 2008»
14 years 12 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak