4759 search results - page 892 / 952 » Parallelizing the Phylogeny Problem |
121
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
119
click to vote
ICDCN
2010
Springer
15 years 9 months ago
2010
Springer
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
134
click to vote
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
147
click to vote
ICDCN
2009
Springer
15 years 9 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
119
click to vote
IEEEPACT
2009
IEEE
2009
IEEE
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
15 years 9 months ago
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...