Sciweavers

28 search results - page 2 / 6
» coco 2005
Sort
View
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
13 years 10 months ago
Computationally Private Randomizing Polynomials and Their Applications
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
COCO
2005
Springer
79views Algorithms» more  COCO 2005»
13 years 10 months ago
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaragh...
ICEIS
2005
IEEE
13 years 10 months ago
COCO: Composition Model and Composition Model Implementation
Component-based software engineering attempts to address the ever increasing demand for new software applications by enabling a compositional approach to software construction in ...
Naiyana Tansalarak, Kajal T. Claypool
COCO
2005
Springer
131views Algorithms» more  COCO 2005»
13 years 10 months ago
On the Hardness of Approximating Multicut and Sparsest-Cut
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuv...
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
13 years 10 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...