2107 search results - page 69 / 422 » Computing Small Search Numbers in Linear Time |
149
click to vote
ENTCS
2008
15 years 6 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
159
click to vote
GLVLSI
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
188
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
152
click to vote
STACS
1997
Springer
15 years 10 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
176
click to vote
EUROPAR
2005
Springer
15 years 11 months ago
2005
Springer
— We present the Adaptive Group Notification (AGNO) scheme for efficiently contacting large peer populations in unstructured Peer-to-Peer networks. AGNO defines a novel implic...