Sciweavers

10997 search results - page 118 / 2200
» On the Structure of Complete Sets
Sort
View
172
Voted
AMAI
2005
Springer
15 years 6 months ago
Logic programming with infinite sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...
Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Ma...
CIKM
2006
Springer
15 years 10 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
PAMI
2008
162views more  PAMI 2008»
15 years 5 months ago
Dimensionality Reduction of Clustered Data Sets
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...
Guido Sanguinetti
RSA
2008
63views more  RSA 2008»
15 years 5 months ago
On the size of the algebraic difference of two random Cantor sets
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 ...
Michel Dekking, Károly Simon
153
Voted
GRC
2005
IEEE
15 years 11 months ago
Improved rule based rough set approach for target recognition
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...
Yong Liu, Congfu Xu, Zhiyong Yan, Yunhe Pan