Sciweavers

1632 search results - page 103 / 327
» On special numberings of hypergraphs
Sort
View
FOCS
2005
IEEE
16 years 7 days ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan
HICSS
2005
IEEE
148views Biometrics» more  HICSS 2005»
16 years 7 days ago
Public-Key-Infrastructure Based on a Peer-to-Peer Network
The goal of a Public-Key-Infrastructure (PKI) is to prove whether a cryptographic public key is authentic for a certain user. This information is crucial for the reliability of as...
Thomas Wölfl
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 5 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
AOSE
2005
Springer
16 years 5 days ago
Dealing with Adaptive Multi-agent Organizations in the Gaia Methodology
Changes and adaptations are always necessary after the deployment of a multiagent system (MAS), as well as of any other type of software systems. Some of these changes may be simpl...
Luca Cernuzzi, Franco Zambonelli
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
16 years 5 days ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant