769 search results - page 96 / 154 » Where Is the Proof |
124
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
132
click to vote
CHI
2008
ACM
16 years 4 months ago
2008
ACM
Recent approaches for linking paper and digital information or services tend to be based on a one-time publishing of digital information where changes to the printed document beco...
113
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
132
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
149
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...