Sciweavers

11 search results - page 1 / 3
» HORPO with Computability Closure: A Reconstruction
Sort
View
LPAR
2007
Springer
14 years 5 months ago
HORPO with Computability Closure: A Reconstruction
Abstract. This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the...
Frédéric Blanqui, Jean-Pierre Jouann...
CORR
2007
Springer
103views Education» more  CORR 2007»
13 years 11 months ago
HORPO with Computability Closure : A Reconstruction
This paper provides a new, decidable definition of the higher-order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for...
Frédéric Blanqui, Jean-Pierre Jouann...
PROPERTYTESTING
2010
13 years 8 months ago
Transitive-Closure Spanners: A Survey
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
Sofya Raskhodnikova
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
14 years 14 days ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
BMVC
1996
14 years 7 days ago
Linear Projective Reconstruction from Matching Tensors
This paperdescribes initial work on a family of projectivereconstructiontechniques that extract projection matrices directly and linearly from matching tensors estimated from imag...
Bill Triggs