We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
Oleg V. Komogortsev, Sampath Jayarathna, Do Hyong ...