3359 search results - page 283 / 672 » A Simplified Idea Algorithm |
125
click to vote
SIAMDM
2002
15 years 3 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
125
Voted
TSMC
2002
15 years 3 months ago
2002
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
137
Voted
PAMI
2010
15 years 1 months ago
2010
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
145
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
162
click to vote
ICDM
2010
IEEE
15 years 23 days ago
2010
IEEE
In active learning, where a learning algorithm has to purchase the labels of its training examples, it is often assumed that there is only one labeler available to label examples, ...