973 search results - page 145 / 195 » New Bounds on Crossing Numbers |
227
click to vote
CAP
2010
15 years 1 months ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
153
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
141
click to vote
ISMB
2001
15 years 7 months ago
2001
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
188
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...