Sciweavers

4354 search results - page 208 / 871
» Classification-based objective functions
Sort
View
DFG
2009
Springer
16 years 1 months ago
Engineering Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s...
Daniel Delling, Peter Sanders, Dominik Schultes, D...
ISVC
2009
Springer
16 years 1 months ago
Deconvolving Active Contours for Fluorescence Microscopy Images
Abstract. We extend active contours to constrained iterative deconvolution by replacing the external energy function with a model-based likelihood. This enables sub-pixel estimatio...
Jo A. Helmuth, Ivo F. Sbalzarini
DATE
2008
IEEE
93views Hardware» more  DATE 2008»
16 years 29 days ago
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
Lei Fang, Michael S. Hsiao
ICPR
2008
IEEE
16 years 28 days ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
WEA
2007
Springer
178views Algorithms» more  WEA 2007»
16 years 18 days ago
Engineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
Peter Sanders, Dominik Schultes