Sciweavers

1327 search results - page 200 / 266
» Path following algorithm for the graph matching problem
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 1 days ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 5 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
106
Voted
EMNLP
2008
15 years 3 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
COMPGEOM
2004
ACM
15 years 7 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
NETWORKING
2007
15 years 3 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen