873 search results - page 60 / 175 » Tournament scoring problem |
153
click to vote
FGR
2002
IEEE
15 years 9 months ago
2002
IEEE
To obtain a quantitative assessment of the state of automatic face recognition, we performed a metaanalysis of performance results of face recognition algorithms in the literature...
120
click to vote
GCB
1997
Springer
15 years 8 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
153
click to vote
KDD
1995
ACM
15 years 7 months ago
1995
ACM
Wedescribe a case study in data miningfor personal loan evaluation, performed at the ABNAMRObank in the Netherlands. Historical data of clients and their pay-backbehaviourare used...
131
click to vote
AAAI
2008
15 years 6 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
142
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...