3591 search results - page 661 / 719 » Typing linear constraints |
161
Voted
ICRA
1994
IEEE
15 years 9 months ago
1994
IEEE
While most previous work in planning manipulation tasks relies on the assumption of quasi-static conditions, there can be situations where the quasi-static assumption may not hold...
168
click to vote
CONPAR
1994
15 years 9 months ago
1994
The rapid advances in high-performancecomputer architectureand compilationtechniques provide both challenges and opportunitiesto exploitthe rich solution space of software pipeline...
139
click to vote
ECCV
2006
Springer
15 years 9 months ago
2006
Springer
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...
153
click to vote
DGCI
2009
Springer
15 years 8 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
161
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...