Sciweavers

2735 search results - page 201 / 547
» Comparing notions of randomness
Sort
View
MABS
2000
Springer
14 years 2 months ago
Effects of Interaction Topology and Activation Regime in Several Multi-Agent Systems
The effects of distinct agent interaction and activation structures are compared and contrasted in several multi-agent models of social phenomena. Random graphs and lattices repre...
Robert L. Axtell
NIPS
2008
14 years 2 days ago
Human Active Learning
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
Rui M. Castro, Charles Kalish, Robert Nowak, Ruich...
COLING
2000
14 years 2 hour ago
A Method of Measuring Term Representativeness - Baseline Method Using Co-occurrence Distribution
This paper introduces a scheme, which we call the baseline method, to define a measure of term representativeness and measures defined by using the scheme. The representativeness ...
Toru Hisamitsu, Yoshiki Niwa, Jun-ichi Tsujii
ML
2006
ACM
13 years 10 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 11 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs