Sciweavers

6142 search results - page 622 / 1229
» The Complexity of Partition Functions
Sort
View
CRYPTO
2008
Springer
76views Cryptology» more  CRYPTO 2008»
15 years 9 months ago
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Ivan Damgård, Yuval Ishai, Mikkel Krø...
CSR
2008
Springer
15 years 9 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
ACL
2008
15 years 8 months ago
Kernels on Linguistic Structures for Answer Extraction
Natural Language Processing (NLP) for Information Retrieval has always been an interesting and challenging research area. Despite the high expectations, most of the results indica...
Alessandro Moschitti, Silvia Quarteroni
ERSA
2007
88views Hardware» more  ERSA 2007»
15 years 8 months ago
Autonomous Computing Systems: A Proposed Roadmap
An autonomous computing system is a system that functions with a large degree of independence, and assumes a large amount of responsibility for its own resources and operation. As...
Neil Steiner, Peter Athanas
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 8 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking