Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
The purpose of this study is to empirically reveal strategies of students' organization of learning-related digital materials within an online personal information archive. Re...
We consider the problem of predicting a sequence of real-valued multivariate states from a given measurement sequence. Its typical application in computer vision is the task of mo...
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...