Sciweavers

4835 search results - page 852 / 967
» Refactoring Functional Programs
Sort
View
PAAPP
2006
44views more  PAAPP 2006»
13 years 9 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner
PR
2006
102views more  PR 2006»
13 years 9 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 9 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
RTS
2006
84views more  RTS 2006»
13 years 9 months ago
Improving WCET by applying worst-case path optimizations
It is advantageous to perform compiler optimizations that attempt to lower the worst-case execution time (WCET) of an embedded application since tasks with lower WCETs are easier ...
Wankang Zhao, William C. Kreahling, David B. Whall...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 9 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl