1859 search results - page 240 / 372 » Using Problems to Learn Service-Oriented Computing |
160
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Maximum margin clustering (MMC) is a recent large margin unsupervised learning approach that has often outperformed conventional clustering methods. Computationally, it involves n...
145
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
168
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
174
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We address the problem of multi-person tracking in a complex scene from a single camera. Although trackletassociation methods have shown impressive results in several challenging ...
188
click to vote
ML
2008
ACM
15 years 4 months ago
2008
ACM
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...