Sciweavers

3406 search results - page 20 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
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
ISBI
2009
IEEE
14 years 2 months ago
Energy Minimization Methods for Cell Motion Correction and Intracellular Analysis in Live-Cell Fluorescence Microscopy
The ultimate aim of many live-cell fluorescence microscopy imaging experiments is the quantitative analysis of the spatial structure and temporal behavior of intracellular object...
Oleh Dzyubachyk, Wiggert A. van Cappellen, Jeroen ...
ICIP
2009
IEEE
14 years 9 months ago
Visual Tracking Of Object Silhouettes
In this paper we propose a new method that addresses the problem of tracking the bitmap (silhouette) of an object in a video under very general conditions. We assume a general tar...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 11 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
GD
2003
Springer
14 years 1 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann