4757 search results - page 187 / 952 » A Unique |
140
click to vote
CSB
2003
IEEE
15 years 10 months ago
2003
IEEE
DNA microarrays are a valuable tool for massively parallel DNA-DNA hybridization experiments. Currently, most applications rely on the existence of sequence-specific oligonucleot...
135
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
128
click to vote
CF
2010
ACM
15 years 9 months ago
2010
ACM
Branches that depend directly or indirectly on load instructions are a leading cause of mispredictions by state-of-the-art branch predictors. For a branch of this type, there is a...
147
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
122
click to vote
ESOP
2001
Springer
15 years 9 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...