15485 search results - page 18 / 3097 » Computing Optimal Subsets |
PDP
2009
IEEE
15 years 4 months ago
2009
IEEE
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
64
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose an effective fingerprint matching algorithm based on ridge count matching and minutiae subset combination. In the algorithm, the orientation-based ridge ...
64
Voted
SPAA
1992
ACM
15 years 1 months ago
1992
ACM
A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in...
84
Voted
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
Feature subset selection, applied as a pre-processing step to machine learning, is valuable in dimensionality reduction, eliminating irrelevant data and improving classifier perfo...