Sciweavers

16093 search results - page 345 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
221
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
TON
2002
138views more  TON 2002»
15 years 6 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
TCOM
2011
83views more  TCOM 2011»
15 years 1 months ago
Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
Adam J. Tenenbaum, Raviraj S. Adve
ICASSP
2011
IEEE
14 years 10 months ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher