893 search results - page 120 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
COCO
2007
Springer
14 years 3 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
IJON
2007
13 years 8 months ago
2007
Experimental and computational studies suggest that complex motor behavior is based on simpler spatiotemporal primitives, or synergies. This has been demonstrated by application o...
ICANNGA
2007
Springer
14 years 3 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
CODES
2007
IEEE
14 years 3 months ago
2007
IEEE
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...