Sciweavers

2181 search results - page 161 / 437
» The restriction scaffold problem
Sort
View
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 22 days ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
104
Voted
JC
2007
101views more  JC 2007»
15 years 21 days ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
89
Voted
JDA
2007
83views more  JDA 2007»
15 years 21 days ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
CAGD
2004
87views more  CAGD 2004»
15 years 20 days ago
Existence of set-interpolating and energy-minimizing curves
We consider existence of curves c : [0, 1] Rn which minimize an energy of the form c(k) p (k = 1, 2, . . . , 1 < p < ) under side-conditions of the form Gj(c(t1,j), . . . ,...
Johannes Wallner
100
Voted
ENTCS
2007
123views more  ENTCS 2007»
15 years 18 days ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...