198 search results - page 32 / 40 » Tensor Rank: Some Lower and Upper Bounds |
116
click to vote
COMGEO
2011
ACM
14 years 5 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
TIT
2010
14 years 4 months ago
2010
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
102
click to vote
ICLP
2010
Springer
2010
Springer
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
14 years 8 months ago
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...