20441 search results - page 3774 / 4089 » Locally Computable Structures |
123
click to vote
JMLR
2002
15 years 3 months ago
2002
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...
166
click to vote
DAM
1999
15 years 3 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
117
click to vote
RAS
1998
15 years 3 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
139
click to vote
RE
2002
Springer
15 years 3 months ago
2002
Springer
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
112
click to vote
SPE
1998
15 years 3 months ago
1998
We are investigating a novel user interface paradigm based on zooming, in which users are presented with a zooming view of a huge planar information surface. We have developed a s...