2570 search results - page 277 / 514 » Fast Algorithms For The Computation Of Ranklets |
99
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we present a novel technique to automatically generate optimum classification cascades. Given a powerful classifier SF with satisfactory accuracy and a set of N cla...
110
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
116
click to vote
ICA3PP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
119
Voted
IBPRIA
2003
Springer
15 years 9 months ago
2003
Springer
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
150
Voted
ECCV
2008
Springer
15 years 4 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...