1140 search results - page 70 / 228 » Sports over a distance |
152
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
154
click to vote
JUCS
2008
15 years 6 months ago
2008
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
184
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
152
click to vote
TIT
2010
15 years 27 days ago
2010
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
164
click to vote
DM
1998
15 years 5 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...