Sciweavers

658 search results - page 70 / 132
» Open problems in the security of learning
Sort
View
ICML
1999
IEEE
14 years 9 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ALT
2004
Springer
14 years 6 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
CSFW
2009
IEEE
14 years 3 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
DANCE
2002
IEEE
14 years 2 months ago
Experiences with Capsule-Based Active Networking
Active Networking adds programmability to the elements of the network, most aggressively by using programmable packets, or capsules. ANTS [1, 2] and PLANet [3, 4] are the most mat...
Michael W. Hicks, Jonathan T. Moore, David Wethera...
ATAL
2004
Springer
14 years 2 months ago
Brain Meets Brawn: Why Grid and Agents Need Each Other
The Grid and agent communities both develop concepts and mechanisms for open distributed systems, albeit from different perspectives. The Grid community has historically focused o...
Ian T. Foster, Nicholas R. Jennings, Carl Kesselma...