Sciweavers

2834 search results - page 72 / 567
» Representing Trees with Constraints
Sort
View
COLING
2000
13 years 10 months ago
Planning texts by constraint satisfaction
A method is de.scribed by which a rhetoricalstructure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, mid other textual patter...
Richard Power
ACL
2008
13 years 10 months ago
Cohesive Phrase-Based Decoding for Statistical Machine Translation
Phrase-based decoding produces state-of-theart translations with no regard for syntax. We add syntax to this process with a cohesion constraint based on a dependency tree for the ...
Colin Cherry
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 10 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis
DKE
2008
103views more  DKE 2008»
13 years 9 months ago
The XML Tree Model - toward an XML conceptual schema reversed from XML Schema Definition
XML Schema Definition (XSD) is the logical schemas of an XML model, but there is no standard format for the conceptual schema of an XML model. Therefore, we propose an XML Tree Mo...
Joseph Fong, San Kuen Cheung, Herbert Shiu
IJCAI
2001
13 years 10 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