Sciweavers

3406 search results - page 532 / 682
» Computational models of classical conditioning
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 4 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
ICPR
2010
IEEE
15 years 2 months ago
A Simulation Study on the Generative Neural Ensemble Decoding Algorithms
Brain-computer interfaces rely on accurate decoding of cortical activity to understand intended action. Algorithms for neural decoding can be broadly categorized into two groups: d...
Sung-Phil Kim, Min-Ki Kim, Gwi-Tae Park
ICSOC
2009
Springer
15 years 2 months ago
Integrating Complex Events for Collaborating and Dynamically Changing Business Processes
Business processes must become agile, respond to changes in the business environment in a timely manner and quickly adapt themselves to new conditions. Event-Driven Business Proces...
Rainer von Ammon, Thomas Ertlmaier, Opher Etzion, ...
CVPR
2011
IEEE
15 years 21 days ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller
ICASSP
2011
IEEE
14 years 8 months ago
Automatically finding semantically consistent n-grams to add new words in LVCSR systems
This paper presents a new method to automatically add n-grams containing out-of-vocabulary (OOV) words to a baseline language model (LM), where these n-grams are sought to be gram...
Gwénolé Lecorvé, Guillaume Gr...