7123 search results - page 73 / 1425 » The Ordered Set of Rough Sets |
ESOP
2000
Springer
14 years 1 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
ICMLA
2008
13 years 11 months ago
2008
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
AML
2005
13 years 10 months ago
2005
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
JSYML
2007
13 years 10 months ago
2007
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract— We consider the following problem of decentralized statistical inference: given i.i.d. samples from an unknown distribution, estimate an arbitrary quantile subject to l...