10988 search results - page 1829 / 2198 » Algorithmic Folding Complexity |
157
click to vote
CAIP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we propose a new manifold representation capable of being applied for visual speech recognition. In this regard, the real time input video data is compressed using P...
138
click to vote
CIA
2007
Springer
15 years 11 months ago
2007
Springer
Physically based rendering is the process of generating a 2D image from the abstract description of a 3D Scene. Despite the development of various new techniques and algorithms, th...
128
click to vote
COCO
2007
Springer
15 years 11 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....
137
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
123
Voted
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...