1124 search results - page 144 / 225 » Constructing Common Information Spaces |
122
click to vote
EUROCRYPT
2005
Springer
15 years 10 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
133
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
201
click to vote
ADHOCNOW
2009
Springer
15 years 2 months ago
2009
Springer
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
156
click to vote
CICLING
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
144
click to vote
HT
2005
ACM
15 years 10 months ago
2005
ACM
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...