Sciweavers

8695 search results - page 106 / 1739
» Making the Complex Simple
Sort
View
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
14 years 3 months ago
Transfer of Learning for Complex Task Domains: a Demonstration using Multiple Robots
— This paper demonstrates a learning mechanism for complex tasks. Such tasks may be inherently expensive to learn in terms of training time and/or cost of obtaining each training...
Sameer Singh, Julie A. Adams
DCC
2011
IEEE
13 years 4 months ago
Accurate estimates of the data complexity and success probability for various cryptanalyses
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
Céline Blondeau, Benoît Gérard...
DIGITEL
2008
IEEE
14 years 4 months ago
Learning about Complexity with Modular Robots
We present progress with roBlocks, a reconfigurable modular robotic system for education. Children snap together small, magnetic, heterogeneous modules to create larger, more comp...
Eric Schweikardt, Mark D. Gross
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 9 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 9 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous