10539 search results - page 2059 / 2108 » On L |
INFORMS
1998
13 years 7 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
JETAI
2002
13 years 7 months ago
2002
We outline the rationale and preliminary results of using the State Context Property (SCOP) formalism, originally developed as a generalization of quantum mechanics, to describe t...
CPC
1999
13 years 7 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
JSYML
1998
13 years 7 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
MVA
2002
13 years 7 months ago
2002
We introduce an image retrieval method for searchingan image database by using a query image that has similarity in its global and/or regional image contents to the intended targe...