Sciweavers

7913 search results - page 436 / 1583
» Information Collection on a Graph
Sort
View
IJCAI
2001
15 years 6 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
ENDM
2007
73views more  ENDM 2007»
15 years 4 months ago
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 4 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
EMNLP
2007
15 years 6 months ago
Using Semantic Roles to Improve Question Answering
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
Dan Shen, Mirella Lapata
ACL
2004
15 years 6 months ago
Enriching the Output of a Parser Using Memory-based Learning
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
Valentin Jijkoun, Maarten de Rijke