Sciweavers

699 search results - page 76 / 140
» A Computational Model for Functional Logic Deductive Databas...
Sort
View
TCIAIG
2010
13 years 2 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
ENTCS
2002
97views more  ENTCS 2002»
13 years 7 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
ICDAR
2009
IEEE
13 years 5 months ago
Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
Florent Montreuil, Emmanuele Grosicki, Laurent Heu...
NECO
2008
116views more  NECO 2008»
13 years 7 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume