Sciweavers

459 search results - page 32 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
ENDM
2008
61views more  ENDM 2008»
13 years 7 months ago
Diameter and Curvature: Intriguing Analogies
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the ...
Antoine Deza, Tamás Terlaky, Feng Xie, Yuri...
TIT
2002
164views more  TIT 2002»
13 years 7 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
IBPRIA
2007
Springer
14 years 1 months ago
Parsimonious Kernel Fisher Discrimination
Abstract. By applying recent results in optimization transfer, a new algorithm for kernel Fisher Discriminant Analysis is provided that makes use of a non-smooth penalty on the coe...
Kitsuchart Pasupa, Robert F. Harrison, Peter Wille...
NIPS
2004
13 years 9 months ago
Newscast EM
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...
Wojtek Kowalczyk, Nikos A. Vlassis