1291 search results - page 212 / 259 » Computing the multiplicity structure in solving polynomial s... |
JPDC
2006
15 years 1 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
103
click to vote
AAAI
1990
15 years 2 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
109
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
121
click to vote
HPCA
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper describes PRISM, a distributed sharedmemory architecture that relies on a tightly integrated hardware and operating system design for scalable and reliable performance....
118
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...