5363 search results - page 930 / 1073 » Building the Cerebellum in a Computer |
168
click to vote
PPSC
1993
15 years 7 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
236
click to vote
AAAI
2008
15 years 7 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
181
click to vote
CONEXT
2009
ACM
15 years 7 months ago
2009
ACM
Dense, unmanaged 802.11 deployments tempt saboteurs into launching jamming attacks by injecting malicious interference. Nowadays, jammers can be portable devices that transmit int...
233
click to vote
CONEXT
2009
ACM
15 years 7 months ago
2009
ACM
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
154
click to vote
MM
2010
ACM
15 years 6 months ago
2010
ACM
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...