27692 search results - page 78 / 5539 » Where is ... |
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
COLT
2001
Springer
14 years 1 months ago
2001
Springer
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes ...
CRYPTO
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
APCHI
2004
IEEE
14 years 17 days ago
2004
IEEE
`Desire Lines' are the ultimate unbiased expression of natural human purpose and refer to tracks worn across grassy spaces, where people naturally walk
COCO
1995
Springer
14 years 12 days ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...