Sciweavers

1529 search results - page 99 / 306
» A slant removal algorithm
Sort
View
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
14 years 5 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
ACIVS
2007
Springer
14 years 4 months ago
Shape Extraction Via Heat Flow Analogy
Abstract. In this paper, we introduce a novel evolution-based segmentation algorithm by using the heat flow analogy, to gain practical advantage. The proposed algorithm consists of...
Cem Direkoglu, Mark S. Nixon
CAEPIA
2007
Springer
14 years 2 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
13 years 8 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
TIP
2010
165views more  TIP 2010»
13 years 5 months ago
Physically Consistent and Efficient Variational Denoising of Image Fluid Flow Estimates
Imaging plays an important role in experimental fluid dynamics. It is equally important both for scientific research and a range of industrial applications. It is known, however, t...
Andrey Vlasenko, Christoph Schnörr