Sciweavers

516 search results - page 3 / 104
» Sets of k-Independent Strings
Sort
View
ACL
2012
11 years 10 months ago
An Exploration of Forest-to-String Translation: Does Translation Help or Hurt Parsing?
Syntax-based translation models that operate on the output of a source-language parser have been shown to perform better if allowed to choose from a set of possible parses. In thi...
Hui Zhang, David Chiang
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 8 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
PROCEDIA
2011
12 years 10 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
ACL
2011
12 years 11 months ago
Adjoining Tree-to-String Translation
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...
Yang Liu, Qun Liu, Yajuan Lü
ISSTA
2012
ACM
11 years 10 months ago
ViewPoints: differential string analysis for discovering client- and server-side input validation inconsistencies
Since web applications are easily accessible, and often store a large amount of sensitive user information, they are a common target for attackers. In particular, attacks that foc...
Muath Alkhalaf, Shauvik Roy Choudhary, Mattia Fazz...