Sciweavers

7129 search results - page 680 / 1426
» Approximation Algorithms for Treewidth
Sort
View
COMPGEOM
2006
ACM
16 years 1 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
WACV
2005
IEEE
16 years 1 months ago
A Fast Multi-Modal Approach to Facial Feature Detection
As interest in 3D face recognition increases the importance of the initial alignment problem does as well. In this paper we present a method utilizing the registered 2D color and ...
Chris Boehnen, Trina Russ
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
16 years 29 days ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
IPSN
2004
Springer
16 years 24 days ago
Distributed particle filters for sensor networks
Abstract. This paper describes two methodologies for performing distributed particle filtering in a sensor network. It considers the scenario in which a set of sensor nodes make m...
Mark Coates
PARA
2004
Springer
16 years 24 days ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...