1017 search results - page 85 / 204 » On the Power of k -Consistency |
TIT
2010
13 years 4 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
TAGT
1994
Springer
14 years 2 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
COMBINATORICA
2007
13 years 10 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
CICC
2011
12 years 10 months ago
2011
Efforts to achieve the long-standing dream of realizing scalable learning algorithms for networks of spiking neurons in silicon have been hampered by (a) the limited scalability of...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...