Sciweavers

1225 search results - page 73 / 245
» The Instance Complexity Conjecture
Sort
View
139
Voted
ATAL
2007
Springer
15 years 9 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
139
Voted
EUROCRYPT
2004
Springer
15 years 8 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
107
Voted
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 3 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
212
Voted
CLUSTER
2006
IEEE
15 years 6 months ago
An Integrated Adaptive Management System for Cluster-based Web Services
The complexity of the cluster-based web service challenges the traditional approaches, which fail to guarantee the reliability and real-time performance required. In this paper, w...
Ying Jiang, Dan Meng, Chao Ren, Jianfeng Zhan
135
Voted
ECML
2006
Springer
15 years 6 months ago
Margin-Based Active Learning for Structured Output Spaces
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
Dan Roth, Kevin Small