Sciweavers

139 search results - page 12 / 28
» Finding Gale Strings
Sort
View
PLDI
2009
ACM
15 years 10 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
MVA
1994
14 years 11 months ago
A Procedure for Segmenting Touching Numbers in Cadastral Maps
We present a procedure to split (or segment) touching numerals. We are neither assuming a dominant orientation for the text direction nor long character strings. The basic idea is...
Gladys Monagan
ACL
2009
14 years 7 months ago
Incorporating Information Status into Generation Ranking
We investigate the influence of information status (IS) on constituent order in German, and integrate our findings into a loglinear surface realisation ranking model. We show that...
Aoife Cahill, Arndt Riester
COLING
1990
14 years 11 months ago
A Spelling Correction Program Based on a Noisy Channel Model
This paper describes a new program, correct, which takes words rejected by the Unix spell program, proposes a list of candidate corrections, and sorts them by probability. The pro...
Mark D. Kernighan, Kenneth Ward Church, William A....
COLT
2008
Springer
14 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim