2381 search results - page 373 / 477 » On Ordering Descriptions in a Description Logic |
146
Voted
EJC
2011
14 years 8 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
110
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
168
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We study the problem of object classification when training
and test classes are disjoint, i.e. no training examples of
the target classes are available. This setup has hardly be...
100
Voted
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
RECOMB
2002
Springer
16 years 2 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...