6251 search results - page 1003 / 1251 » Randomness, Computability, and Density |
147
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
151
click to vote
CG
2002
Springer
15 years 4 months ago
2002
Springer
Cribbage is (normally) a two-player card game where the aim is to score 121 points before your opponent. The game has four stages, one of which involves discarding two cards from t...
149
click to vote
CN
2002
15 years 4 months ago
2002
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottlene...
132
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
146
click to vote
DCG
2000
15 years 4 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...