16257 search results - page 296 / 3252 » D-finiteness: algorithms and applications |
177
click to vote
CAGD
2004
15 years 6 months ago
2004
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
182
click to vote
IJPP
2010
15 years 5 months ago
2010
In this paper, we define the problem of spatial mapping. We present reasons why performing spatial mappings at run-time is both necessary and desirable. We propose what is—to ou...
191
click to vote
COR
2011
15 years 1 months ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
126
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
220
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...