Learn More
In this paper we study the Optimal Cost Chromatic Partition (OCCP) problem for trees and interval graphs. The OCCP problem is the problem of coloring the nodes of a graph in such a way that adjacent nodes obtain diierent colors and that the total coloring costs are minimum. In this paper we rst give a linear time algorithm for the OCCP problem for trees.(More)
This paper presents a new learning theory (a set of principles for brain-like learning) and a corresponding algorithm for the neural-network field. The learning theory defines computational characteristics that are much more brain-like than that of classical connectionist learning. Robust and reliable learning algorithms would result if these learning(More)
This paper presents a new learning algorithm for multitask pattern recognition (MTPR) problems. We consider learning multiple multiclass classification tasks online where no information is ever provided about the task category of a training example. The algorithm thus needs an automated task recognition capability to properly learn the different(More)
This paper presents an algorithm for constructing and training a class of higher-order perceptrons for classification problems. The method uses linear programming models to construct and train the net. Its polynomial time complexity is proven and computational results are provided for several well-known problems. In all cases, very small nets were created(More)
Cataplexy is a complex neurologic phenomenon during wakefulness probably resulting from impairment of pontine and hypothalamic control over muscle tone. REM sleep behavior disorder (RSBD) is characterized by the presence of REM sleep without atonia manifesting clinically as disruptive or injurious behaviors. We present here a patient with both cataplexy and(More)
  • Asim Roy
  • 2015 International Joint Conference on Neural…
  • 2015
Here we describe a new algorithm that uses Kohonen networks at its core for class-based feature selection and for learning to recognize classes of patterns. This online algorithm is meant for streaming big data and for highly parallel implementation on a platform such as Apache Spark. The algorithm works in two phases. In the initial phase, it examines some(More)