1071 search results - page 201 / 215 » Programming with enumerable sets of structures |
114
click to vote
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
102
click to vote
ICS
2003
Tsinghua U.
15 years 3 months ago
2003
Tsinghua U.
Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of Inferentially...
108
click to vote
ESANN
2004
14 years 12 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
PDPTA
2000
14 years 11 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
BMCBI
2010
14 years 10 months ago
2010
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...