2192 search results - page 170 / 439 » Algorithms for Challenging Motif Problems |
134
click to vote
CVPR
2010
IEEE
16 years 14 days ago
2010
IEEE
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...
140
Voted
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
160
click to vote
ISMB
1994
15 years 6 months ago
1994
The automatic generation of drawings of metabolic pathways is a challenging problem that depends intimately on exactly what information has been recorded for each pathway, and on ...
146
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
154
Voted
TC
2010
14 years 11 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...