3172 search results - page 30 / 635 » On the Random-Self-Reducibility of Complete Sets |
CL
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
PAMI
2008
13 years 10 months ago
2008
We present a novel probabilistic latent variable model to perform linear dimensionality reduction on data sets which contain clusters. We prove that the maximum likelihood solution...
RSA
2008
13 years 10 months ago
2008
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
GRC
2005
IEEE
14 years 4 months ago
2005
IEEE
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
CBSE
2007
Springer
14 years 5 months ago
2007
Springer
Binary component-based software updates that are efficient, safe and generic still remain a challenge. Most existing deployment systems that achieve this goal have to control the c...