170 search results - page 20 / 34 » Parsing with Non-Deterministic Functions |
TSE
2010
13 years 5 months ago
2010
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
INTERSPEECH
2010
13 years 2 months ago
2010
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
DIMVA
2004
13 years 9 months ago
2004
: A method to heuristically construct an isomorphism between the sets of functions in two similar but differing versions of the same executable file is presented. Such an isomorphi...
NIPS
2003
13 years 8 months ago
2003
We present a system to recognize phrases based on perceptrons, and a global online learning algorithm to train them together. The recognition strategy applies learning in two laye...
LFP
1990
13 years 8 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...