A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
o address the need for canonical abstraction, we've adopted software engineering's concept of signatures--a technique for defining software patterns or invariant procedur...
The human hand is an important interface with complex shape and movement. In virtual reality and gaming applications the use of an individualized rather than generic hand represen...
Following ideas of Richer (2000) we introduce the notion of unordered regressive Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of Ackermannian growt...
Typically data acquired through imaging techniques such as functional magnetic resonance imaging (fMRI), structural MRI (sMRI), and electroencephalography (EEG) are analyzed separ...