Sciweavers

1798 search results - page 217 / 360
» A Tree for All Seasons
Sort
View
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
14 years 1 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
DEXA
2007
Springer
126views Database» more  DEXA 2007»
14 years 1 months ago
Compiling Declarative Specifications of Parsing Algorithms
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
Carlos Gómez-Rodríguez, Jesús...
DLS
2007
138views Languages» more  DLS 2007»
14 years 1 months ago
OMeta: an object-oriented language for pattern matching
This paper introduces OMeta, a new object-oriented language for pattern matching. OMeta is based on a variant of Parsing Expression Grammars (PEGs) [5]--a recognitionbased foundat...
Alessandro Warth, Ian Piumarta
ECML
2007
Springer
14 years 1 months ago
Modeling Highway Traffic Volumes
Most traffic management and optimization tasks, such as accident detection or optimal vehicle routing, require an ability to adequately model, reason about and predict irregular an...
Tomás Singliar, Milos Hauskrecht
ECML
2007
Springer
14 years 1 months ago
Efficient Computation of Recursive Principal Component Analysis for Structured Input
Recently, a successful extension of Principal Component Analysis for structured input, such as sequences, trees, and graphs, has been proposed. This allows the embedding of discret...
Alessandro Sperduti