Sciweavers

2635 search results - page 370 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
CCGRID
2006
IEEE
14 years 3 months ago
Adapting Distributed Shared Memory Applications in Diverse Environments
A problem with running distributed shared memory applications in heterogeneous environments is that making optimal use of available resources often requires significant changes t...
Daniel Potts, Ihor Kuz
ICALP
2005
Springer
14 years 2 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 2 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
PARA
2004
Springer
14 years 2 months ago
Cache Optimizations for Iterative Numerical Codes Aware of Hardware Prefetching
Cache optimizations typically include code transformations to increase the locality of memory accesses. An orthogonal approach is to enable for latency hiding by introducing prefet...
Josef Weidendorfer, Carsten Trinitis
EUROPAR
2001
Springer
14 years 1 months ago
An Efficient Indirect Branch Predictor
In this paper, we present a new hybrid branch predictor called the GoStay2, which can effectively reduce indirect misprediction rates. The GoStay2 has two different mechanisms comp...
Yul Chu, Mabo Robert Ito