27 search results - page 2 / 6 » Efficiency Bounds for Adversary Constructions in Black-Box R... |
80
Voted
TIT
2010
14 years 4 months ago
2010
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...
84
Voted
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
107
Voted
CEC
2010
IEEE
14 years 1 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
94
Voted
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...