Sciweavers

4095 search results - page 339 / 819
» How to test a tree
Sort
View
CMS
2003
101views Communications» more  CMS 2003»
15 years 7 months ago
Watermark Security via Secret Wavelet Packet Subband Structures
Abstract. Wavelet packet decompositions generalize the classical pyramidal wavelet structure. We use the vast amount of possible wavelet packet decomposition structures to create a...
Werner Dietl, Andreas Uhl
COLING
2000
15 years 6 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
140
Voted
FLAIRS
1998
15 years 6 months ago
Implementing Parser Metarules that Handle Speech Repairs and Other Disruptions
Mixed-initiative dialogs often contain interruptions in phrase structure such as repairs and backchannel responses. Phrase structure as traditionally de ned does not accommodate s...
Mark G. Core, Lenhart K. Schubert
ATAL
2010
Springer
15 years 6 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
CADE
2010
Springer
15 years 6 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold