1973 search results - page 173 / 395 » The Construction of Ludic Space |
176
click to vote
DCG
2008
15 years 6 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
226
click to vote
IJCV
2006
15 years 6 months ago
2006
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
162
click to vote
IJRR
2002
15 years 6 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
199
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
174
click to vote
ECCV
1994
Springer
16 years 8 months ago
1994
Springer
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...