Sciweavers

10602 search results - page 25 / 2121
» Weakly Useful Sequences
Sort
View
AAMAS
2005
Springer
13 years 9 months ago
Learning and Exploiting Relative Weaknesses of Opponent Agents
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
Shaul Markovitch, Ronit Reger
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
14 years 9 months ago
Oblivious Transfer from Weak Noisy Channels
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because i...
Jürg Wullschleger
ENTCS
2007
89views more  ENTCS 2007»
13 years 9 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 2 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
13 years 11 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman