Sciweavers

226 search results - page 6 / 46
» Parsing with the Shortest Derivation
Sort
View
CODCRY
2011
Springer
264views Cryptology» more  CODCRY 2011»
13 years 1 months ago
Algorithms for the Shortest and Closest Lattice Vector Problems
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
IPPS
2007
IEEE
14 years 4 months ago
A Combinatorial Analysis of Distance Reliability in Star Network
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
Xiaolong Wu, Shahram Latifi, Yingtao Jiang
AIR
2004
97views more  AIR 2004»
13 years 9 months ago
Parsing Ill-Formed Text Using an Error Grammar
This paper presents a robust parsing approach which is designed to address the issue of syntactic errors in text. The approach is based on the concept of an error grammar which is ...
Jennifer Foster, Carl Vogel
SIGSOFT
2008
ACM
14 years 10 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
EMNLP
2007
13 years 11 months ago
Probabilistic Models of Nonprojective Dependency Trees
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit t...
David A. Smith, Noah A. Smith