We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
A strength of commitment protocols is that they enable agents to act flexibly, thereby enabling them to accommodate varying local policies and respond to exceptions. A consequent ...
— We propose a method for automatic emotion recognition as part of the FERA 2011 competition [1] . The system extracts pyramid of histogram of gradients (PHOG) and local phase qu...
Abhinav Dhall, Akshay Asthana, Roland Goecke, Tom ...
Pervasive computing appears like a new computing era based on networks of objects and devices evolving in a real world, radically different from distributed computing, based on ne...
The protein-protein interaction networks of even well-studied model organisms are sketchy at best, highlighting the continued need for computational methods to help direct experim...