Sciweavers

1732 search results - page 32 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 6 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
INFOCOM
2009
IEEE
16 years 20 days ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
JUCS
2008
158views more  JUCS 2008»
15 years 6 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 6 months ago
Periodicity of certain piecewise affine planar maps
We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for λ ∈ { ±1± √ 5 2 , ± √ 2, ± √ 3} that...
Shigeki Akiyama, Horst Brunotte, Attila Pethö...
EJC
2006
15 years 6 months ago
Hamiltonicity of digraphs for universal cycles of permutations
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
Garth Isaak