Sciweavers

794 search results - page 29 / 159
» Improved algorithms for orienteering and related problems
Sort
View
MICCAI
2009
Springer
14 years 11 months ago
Endoscopic Orientation Correction
Abstract. An open problem in endoscopic surgery (especially with flexible endoscopes) is the absence of a stable horizon in endoscopic images. With our "Endorientation" a...
Kurt Höller, Jochen Penne, Armin Schneider, J...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 8 months ago
Feature Construction for Relational Sequence Learning
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 11 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
TIT
1998
79views more  TIT 1998»
13 years 10 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
IBPRIA
2007
Springer
14 years 59 min ago
A Density-Based Data Reduction Algorithm for Robust Estimators
In this paper we present a non parametric density-based data reduction technique designed to be used in robust parameter estimation problems. Existing approaches are focused on red...
Luis Ferraz, Ramon Lluis Felip, Brais Martí...