Sciweavers

4743 search results - page 265 / 949
» The PlusCal Algorithm Language
Sort
View
NAACL
2010
15 years 4 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
NAACL
2010
15 years 4 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 9 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICIP
1998
IEEE
16 years 7 months ago
Hiding Information in Images
In this study, a new algorithm is proposed for the cryptography and steganography of an image or text. There is a variety of steganography and cryptography tools which are commonl...
Lisa M. Marvel, Charles T. Retter, Charles G. Bonc...
ICALP
2007
Springer
16 years 12 days ago
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...
Michael Elkin