Sciweavers

3885 search results - page 497 / 777
» Transformations for Write-All-with-Collision Model
Sort
View
FOCM
2008
156views more  FOCM 2008»
15 years 6 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
JMLR
2008
131views more  JMLR 2008»
15 years 6 months ago
On Relevant Dimensions in Kernel Feature Spaces
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
Mikio L. Braun, Joachim M. Buhmann, Klaus-Robert M...
ENTCS
2007
128views more  ENTCS 2007»
15 years 6 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
151
Voted
ISCI
2007
135views more  ISCI 2007»
15 years 6 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
JSAC
2007
102views more  JSAC 2007»
15 years 6 months ago
Partially-coherent distributed space-time codes with differential encoder and decoder
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
T. Kiran, B. Sundar Rajan