4860 search results - page 523 / 972 » SNPs Problems, Complexity, and Algorithms |
158
Voted
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
154
click to vote
AUSAI
2007
Springer
16 years 1 months ago
2007
Springer
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
164
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
152
click to vote
INFOCOM
2005
IEEE
16 years 14 days ago
2005
IEEE
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
178
Voted
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...