1405 search results - page 111 / 281 » Anytime Algorithm for Feature Selection |
129
Voted
ICCV
1999
IEEE
15 years 6 months ago
1999
IEEE
A motion segmentation algorithm based on factorization method and discriminant criterion is proposed. This method uses a feature with the most useful similarities for grouping, se...
119
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Feature selection techniques are critical to the analysis of high dimensional datasets. This is especially true in gene selection from microarray data which are common...
120
click to vote
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
111
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
129
Voted
SDM
2004
SIAM
15 years 3 months ago
2004
SIAM
Most previously proposed mining methods on data streams make an unrealistic assumption that "labelled" data stream is readily available and can be mined at anytime. Howe...