Sciweavers

218 search results - page 10 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
COLT
1999
Springer
13 years 12 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...
COLT
2000
Springer
13 years 12 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
TC
2008
13 years 7 months ago
Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
Majid Khabbazian, Vijay K. Bhargava
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
14 years 1 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
ICIP
2005
IEEE
14 years 9 months ago
Effective rate control method for minimizing temporal fluctuations in picture quality applicable for MPEG-4 AVC/H.264 encoding
Appropriate rate control plays a very important role in encoding motion pictures under the constant bit-rate. One of the requirements for rate control is minimizing temporal fluct...
Atsushi Matsumura, Sei Naito, Ryoichi Kawada, Atsu...