4176 search results - page 804 / 836 » Parallelizing Support Vector Machines on Distributed Compute... |
PPSN
1990
Springer
15 years 1 months ago
1990
Springer
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
BMCBI
2006
14 years 9 months ago
2006
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
119
click to vote
HPCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Hardware transactional memory should support unbounded transactions: transactions of arbitrary size and duration. We describe a hardware implementation of unbounded transactional ...
WMPI
2004
ACM
15 years 3 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...