Sciweavers

1814 search results - page 23 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 7 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
COMPGEOM
2001
ACM
13 years 11 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
FCT
2005
Springer
14 years 1 months ago
The Complexity of Semilinear Problems in Succinct Representation
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
Peter Bürgisser, Felipe Cucker, Paulin Jacob&...
JAL
2006
89views more  JAL 2006»
13 years 7 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler
ICMCS
2006
IEEE
134views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Automatic Extraction of Geometric Lip Features with Application to Multi-Modal Speaker Identification
In this paper we consider the problem of automatic extraction of the geometric lip features for the purposes of multi-modal speaker identification. The use of visual information ...
Ivana Arsic, Roger Vilagut, Jean-Philippe Thiran