1041 search results - page 48 / 209 » Randomizing Reductions of Search Problems |
DAM
2000
13 years 8 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We propose a unified global entropy reduction maximization (GERM) framework for active learning and semi-supervised learning for speech recognition. Active learning aims to select...
KI
1999
Springer
14 years 10 days ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
PR
2007
13 years 7 months ago
2007
Ensemble learning is attracting much attention from pattern recognition and machine learning domains for good generalization. Both theoretical and experimental researches show tha...