541 search results - page 30 / 109 » Factoring Solution Sets of Polynomial Systems in Parallel |
100
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
103
click to vote
OTM
2007
Springer
15 years 5 months ago
2007
Springer
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
130
click to vote
ICS
2005
Tsinghua U.
15 years 5 months ago
2005
Tsinghua U.
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
118
click to vote
ICPPW
2009
IEEE
14 years 9 months ago
2009
IEEE
Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular appr...