The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estima...
One of the most common functions of smart environments is to monitor and assist older adults with their activities of daily living. Activity recognition is a key component in this...
Ehsan Nazerfard, Barnan Das, Lawrence B. Holder, D...
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...