Sciweavers

169 search results - page 32 / 34
» arc 2007
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
13 years 4 months ago
Improving the Context-sensitive Dependency Graph
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
Beatriz Alarcón, Raúl Gutiérr...
4OR
2010
148views more  4OR 2010»
13 years 3 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
IJCAI
1989
13 years 6 months ago
Formal Properties and Implementation of Bidirectional Charts
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
Giorgio Satta, Oliviero Stock
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 6 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
BMCBI
2006
119views more  BMCBI 2006»
13 years 4 months ago
A methodology for the structural and functional analysis of signaling and regulatory networks
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...
Steffen Klamt, Julio Saez-Rodriguez, Jonathan A. L...