Sciweavers

1007 search results - page 53 / 202
» The Complexity of Futile Questioning
Sort
View
DSN
2007
IEEE
15 years 10 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
EUROCRYPT
2004
Springer
15 years 9 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
AAAI
2000
15 years 5 months ago
Making Rational Decisions Using Adaptive Utility Elicitation
Rational decision making requires full knowledge of the utility function of the person affected by the decisions. However, in many cases, the task of acquiring such knowledge is n...
Urszula Chajewska, Daphne Koller, Ronald Parr
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 4 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
ACL
1994
15 years 5 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick