Sciweavers

1328 search results - page 243 / 266
» Cut-free common knowledge
Sort
View
FOCS
1990
IEEE
15 years 1 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
CONEXT
2007
ACM
15 years 1 months ago
Proactive replication in distributed storage systems using machine availability estimation
Distributed storage systems provide data availability by means of redundancy. To assure a given level of availability in case of node failures, new redundant fragments need to be ...
Alessandro Duminuco, Ernst Biersack, Taoufik En-Na...
CIKM
2009
Springer
15 years 1 months ago
Improving binary classification on text problems using differential word features
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
Justin Martineau, Tim Finin, Anupam Joshi, Shamit ...
CLUSTER
2009
IEEE
15 years 1 months ago
24/7 Characterization of petascale I/O workloads
Abstract--Developing and tuning computational science applications to run on extreme scale systems are increasingly complicated processes. Challenges such as managing memory access...
Philip H. Carns, Robert Latham, Robert B. Ross, Ka...
FC
2010
Springer
205views Cryptology» more  FC 2010»
15 years 1 months ago
On Robust Key Agreement Based on Public Key Authentication
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
Feng Hao