Sciweavers

898 search results - page 24 / 180
» Computational Kernels and their Application to Sequential Po...
Sort
View
IPPS
1999
IEEE
15 years 1 months ago
Optimizing Irregular HPF Applications using Halos
This paper presents language features for High Performance Fortran HPF to specify non-local access patterns of distributed arrays, called halos, and to control the communication as...
Siegfried Benkner
DCC
2009
IEEE
15 years 10 months ago
Compressed Kernel Perceptrons
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...
Slobodan Vucetic, Vladimir Coric, Zhuang Wang
PADS
2000
ACM
15 years 2 months ago
Applying parallel discrete event simulation to network emulation
The simulation of wide area computer networks is one area where the benefits of parallel simulation have been clearly demonstrated. Here we present a description of a system that...
Rob Simmonds, Russell Bradford, Brian Unger
85
Voted
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
81
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 7 months ago
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
Matthias Hein, Thomas Bühler