9736 search results - page 74 / 1948 » How Fast Can We Compute Products |
125
click to vote
JC
2010
14 years 11 months ago
2010
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
144
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
129
click to vote
CCA
2005
Springer
15 years 6 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
111
click to vote
FDL
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we compare the underlying models of computation of the system description languages SystemC and Esterel. Although these languages have a rather different origin, we...
106
click to vote
KI
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we first review our work in the domain of dextrous manipulation, where we introduced Manipulation Manifolds – a highly structured manifold representation of hand ...