3758 search results - page 230 / 752 » A Complete Subsumption Algorithm |
151
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
167
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
176
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper deals with the reconstruction of smooth, flexible, isometrically embedded flat surfaces in 3D, such as a sheet of paper or a flag waving in the wind, from a set of 2...
175
click to vote
AAIM
2007
Springer
16 years 16 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
169
click to vote
ACIVS
2007
Springer
16 years 16 days ago
2007
Springer
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...