Sciweavers

124 search results - page 1 / 25
» Randomly supported independence and resistance
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 7 days ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
DSN
2005
IEEE
15 years 5 months ago
Perturbation-Resistant and Overlay-Independent Resource Discovery
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
Steven Y. Ko, Indranil Gupta
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
15 years 1 months ago
Approximation Resistant Predicates from Pairwise Independence
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
Per Austrin, Elchanan Mossel
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
15 years 5 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
15 years 6 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu