5802 search results - page 570 / 1161 » Parallelizing Feature Selection |
203
click to vote
SADM
2010
15 years 5 months ago
2010
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
172
click to vote
SOCO
2010
Springer
15 years 5 months ago
2010
Springer
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
199
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a bottom-up tracking algorithm for surveillance applications where speed and reliability in the case of multiple matches and occlusions are major concerns. The...
219
click to vote
TSE
2011
15 years 1 months ago
2011
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...
226
click to vote
JMLR
2012
13 years 9 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...