Sciweavers

11740 search results - page 113 / 2348
» More Problems in Rewriting
Sort
View
ICIP
1998
IEEE
15 years 5 months ago
Segmentation as a Riemannian Drum Problem
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
Jayant Shah
DATE
1997
IEEE
80views Hardware» more  DATE 1997»
15 years 5 months ago
Hybrid symbolic-explicit techniques for the graph coloring problem
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mat...
91
Voted
DCG
2006
101views more  DCG 2006»
15 years 23 days ago
Isodiametric Problems for Polygons
The maximal area of a polygon with n = 2m edges and unit diameter is not known when m 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known...
Michael J. Mossinghoff
100
Voted
4OR
2004
84views more  4OR 2004»
15 years 19 days ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
CEC
2008
IEEE
15 years 7 months ago
Methods for decreasing the number of objective evaluations for independent computationally expensive objective problems
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
Greg Rohling