288 search results - page 15 / 58 » random 1998 |
83
Voted
CVPR
1998
IEEE
16 years 8 days ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
75
Voted
ICML
1998
IEEE
15 years 11 months ago
1998
IEEE
Three factors are related in analyses of performance curves such as learning curves: the amount of training, the learning algorithm, and performance. Often we want to know whether...
99
Voted
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
64
Voted
AAAI
1998
14 years 11 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
72
Voted
PAMI
1998
14 years 10 months ago
1998
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...