Sciweavers

6120 search results - page 865 / 1224
» The Power of Linear Functions
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
IJCNN
2007
IEEE
16 years 1 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
GECCO
2004
Springer
16 years 6 days ago
A Step Size Preserving Directed Mutation Operator
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
Stefan Berlik
FOCS
2000
IEEE
15 years 10 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
NIPS
1998
15 years 8 months ago
Semi-Supervised Support Vector Machines
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
Kristin P. Bennett, Ayhan Demiriz