3172 search results - page 30 / 635 » On the Random-Self-Reducibility of Complete Sets |
101
Voted
CL
2000
Springer
15 years 5 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 ...
122
click to vote
PAMI
2008
15 years 4 days 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...
82
Voted
RSA
2008
15 years 3 days 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 ...
98
Voted
GRC
2005
IEEE
15 years 6 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...
102
Voted
CBSE
2007
Springer
15 years 6 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...