Sciweavers

1327 search results - page 208 / 266
» Path following algorithm for the graph matching problem
Sort
View
PROCEDIA
2010
344views more  PROCEDIA 2010»
15 years 4 days ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
ICCV
1999
IEEE
16 years 2 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
ITC
1993
IEEE
148views Hardware» more  ITC 1993»
15 years 5 months ago
DELTEST: Deterministic Test Generation for Gate-Delay Faults
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
Udo Mahlstedt
CALCO
2005
Springer
75views Mathematics» more  CALCO 2005»
15 years 7 months ago
Parametrized Exceptions
Following the paradigm of encapsulation of side effects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful ...
Dennis Walter, Lutz Schröder, Till Mossakowsk...
CIKM
2007
Springer
15 years 5 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang