725 search results - page 34 / 145 » Descriptive Set Theory of Families of Small Sets |
COSIT
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a qualitative shape description which has previously been proven to be useful for object categorisation. The description is based on a set of shape primitives ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
GD
2003
Springer
15 years 2 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
114
Voted
KES
2007
Springer
2007
Springer
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
15 years 3 months ago
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...