2877 search results - page 453 / 576 » The Complexity of Planarity Testing |
131
click to vote
IJCSA
2007
15 years 3 months ago
2007
The main aim of this paper is to establish a reliable model both for the steady-state and unsteady-state regimes of a nonlinear process. The use of this model should reflect the t...
131
Voted
IJPRAI
2002
15 years 3 months ago
2002
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
129
click to vote
DAM
1998
15 years 3 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
122
click to vote
ARTMED
1999
15 years 3 months ago
1999
We present a Two-Stage Machine Learning (ML) model as a data mining method to develop practice guidelines and apply it to the problem of dementia staging. Dementia staging in clin...
109
click to vote
MOC
1998
15 years 3 months ago
1998
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...