Sciweavers

3913 search results - page 118 / 783
» complexity 2006
Sort
View
JCSS
2006
52views more  JCSS 2006»
13 years 10 months ago
LWPP and WPP are not uniformly gap-definable
Resolving an issue open since Fenner, Fortnow, and Kurtz raised it in [FFK94], we prove that LWPP is not uniformly gap-definable and that WPP is not uniformly gap-definable. We do...
Holger Spakowski, Rahul Tripathi
JRTIP
2006
119views more  JRTIP 2006»
13 years 10 months ago
Achieving real-time object detection and tracking under extreme conditions
In this survey, we present a brief analysis of single camera object detection and tracking methods. We also give a comparison of their computational complexities. These methods ar...
Fatih Porikli
JLP
2010
96views more  JLP 2010»
13 years 8 months ago
Implicit characterizations of FPTIME and NC revisited
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
Karl-Heinz Niggl, Henning Wunderlich
JEC
2006
69views more  JEC 2006»
13 years 10 months ago
Application partitioning on programmable platforms using the ant colony optimization
Modern digital systems consist of a complex mix of computational resources, e.g. microprocessors, memory elements and reconfigurable logic. System partitioning
Gang Wang, Wenrui Gong, Ryan Kastner
RAS
2006
111views more  RAS 2006»
13 years 10 months ago
Robot learning through task identification
The operation of an autonomous mobile robot in a semi-structured environment is a complex, usually non-linear and partly unpredictable process. Lacking a theory of robot
Ulrich Nehmzow, Roberto Iglesias, Theocharis Kyria...