Sciweavers

1695 search results - page 313 / 339
» Linear, Polynomial or Exponential
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 4 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 2 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
NIPS
2007
15 years 2 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
120
Voted
BMCBI
2007
154views more  BMCBI 2007»
15 years 25 days ago
Classification of heterogeneous microarray data by maximum entropy kernel
Background: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are c...
Wataru Fujibuchi, Tsuyoshi Kato
109
Voted
CORR
2008
Springer
172views Education» more  CORR 2008»
15 years 24 days ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik