26354 search results - page 4939 / 5271 » How we refactor, and how we know it |
218
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
214
click to vote
NEUROSCIENCE
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. A general principle of cortical architecture is the bidirectional flow of information along feedforward and feedback connections. In the feedforward path, converging con...
207
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
189
click to vote
DCC
2000
IEEE
15 years 11 months ago
2000
IEEE
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
202
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...