Sciweavers

1188 search results - page 23 / 238
» Extended Graph Unification
Sort
View
ACL
2007
15 years 1 months ago
Extending MARIE: an N-gram-based SMT decoder
In this paper we present several extensions of MARIE1 , a freely available N-gram-based statistical machine translation (SMT) decoder. The extensions mainly consist of the ability...
Josep Maria Crego, José B. Mariño
CATS
2008
15 years 1 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
DM
2008
86views more  DM 2008»
14 years 12 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 7 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled