1242 search results - page 155 / 249 » A Computational Complexity Theory in Membrane Computing |
ICCV
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
MHCI
2007
Springer
15 years 4 months ago
2007
Springer
Conversation partners on mobile phones can align their walking gait without physical proximity or visual feedback. We investigate gait synchronization, measured by accelerometers ...
STACS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
CGI
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents a quasi-physically based approach for interactively simulating large-scale dynamic forest scenes under different wind conditions. We introduce theories from th...
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...