Sciweavers

752 search results - page 81 / 151
» Faster approximation algorithms for the minimum latency prob...
Sort
View
148
Voted
ICPR
2010
IEEE
15 years 1 months ago
Incremental Training of Multiclass Support Vector Machines
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
Symeon Nikitidis, Nikos Nikolaidis, Ioannis Pitas
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 3 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
EOR
2007
90views more  EOR 2007»
15 years 3 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...
IPPS
2005
IEEE
15 years 9 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
99
Voted
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 3 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani