520 search results - page 3 / 104 » Subset Counting in Trees |
ICPR
2006
IEEE
14 years 8 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 ...
OPODIS
2004
13 years 9 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
ARSCOM
2007
13 years 7 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
Many organizations have large quantities of spatial data collected in various application areas, including remote sensing, geographical information systems (GIS), astronomy, compu...