279 search results - page 1 / 56 » 20 Years of ECM |
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
QUEUE
2008
13 years 4 months ago
2008
TIT
1998
13 years 4 months ago
1998
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
IJHCI
2007
13 years 4 months ago
2007
We present a visual exploration of the field of human-computer interaction through the author and article metadata of four of its major conferences: the ACM conferences on Comput...