1763 search results - page 49 / 353 » Dependent random choice |
ACL
2004
13 years 10 months ago
2004
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
TIT
2008
13 years 9 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
DIMVA
2008
13 years 10 months ago
2008
Over the past several years, US-CERT advisories, as well as most critical updates from software vendors, have been due to memory corruption vulnerabilities such as buffer overflo...
FM
2006
Springer
14 years 22 days ago
2006
Springer
While designing a service-oriented system, deciding whether a service interaction is desired or harmful is a subjective choice which depends on the requirements expressed by the us...