269 search results - page 49 / 54 » random 2001 |
SODA
2012
ACM
12 years 10 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
NIPS
2001
13 years 11 months ago
2001
Mutual information is widely used, in a descriptive way, to measure the stochastic dependence of categorical random variables. In order to address questions such as the reliabilit...
WWW
2003
ACM
14 years 10 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...