5981 search results - page 249 / 1197 » time 2006 |
170
click to vote
RSA
2000
15 years 6 months ago
2000
A succinct series expression is derived for describing the limit distribution of the number of times r consecutive elements are all records (in a sequence of independent and ident...
143
click to vote
IPL
2002
15 years 6 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
162
click to vote
JACM
2002
15 years 6 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
167
click to vote
IPL
1998
15 years 6 months ago
1998
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
157
click to vote
ORL
1998
15 years 6 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...