1359 search results - page 190 / 272 » Probabilistic Points-to Analysis |
141
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
180
click to vote
ALGORITHMICA
1998
15 years 4 months ago
1998
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
147
click to vote
ALGORITHMICA
1999
15 years 4 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
152
click to vote
MOC
2002
15 years 3 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
145
click to vote
TSE
2002
15 years 3 months ago
2002
Software system documentation is almost always expressed informally in natural language and free text. Examples include requirement specifications, design documents, manual pages, ...