364 search results - page 46 / 73 » Dimension Characterizations of Complexity Classes |
EDBT
2004
ACM
14 years 8 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
IANDC
2006
13 years 8 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
MICCAI
2004
Springer
14 years 9 months ago
2004
Springer
Extraction of structures of interest in medical images is often an arduous task because of noisy or incomplete data. However, handsegmented data are often available and most of the...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
JMIV
2006
13 years 8 months ago
2006
The paper presents a new set of axioms of digital topology, which are easily understandable for application developers. They define a class of locally finite (LF) topological space...