Sciweavers

2526 search results - page 266 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
145
Voted
VMV
2003
154views Visualization» more  VMV 2003»
15 years 6 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
BILDMED
2009
135views Algorithms» more  BILDMED 2009»
15 years 5 months ago
High Quality Image Magnification Using Cross-Scale Self-Similarity
In medical imaging there is a frequent need to magnify a certain region of interest (ROI) of an image. However many modalities suffer from severe noise and traditional upscaling me...
André Gooßen, Arne Ehlers, Thomas Pra...
ACTAC
2007
69views more  ACTAC 2007»
15 years 4 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
EOR
2006
110views more  EOR 2006»
15 years 4 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta
JAR
2006
106views more  JAR 2006»
15 years 4 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis