6251 search results - page 263 / 1251 » Randomness, Computability, and Density |
120
click to vote
CSR
2007
Springer
15 years 11 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
159
click to vote
CHES
2005
Springer
15 years 10 months ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
124
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
142
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
136
click to vote
ISPAN
1999
IEEE
15 years 9 months ago
1999
IEEE
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...