Sciweavers

1055 search results - page 117 / 211
» Enumerations in computable structure theory
Sort
View
JACM
2010
116views more  JACM 2010»
15 years 2 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
CVPR
2005
IEEE
16 years 6 months ago
Coupled PDEs for Non-Rigid Registration and Segmentation
In this paper we present coupled partial differential equations (PDEs) for the problem of joint segmentation and registration. The registration component of the method estimates a...
Gozde B. Unal, Gregory G. Slabaugh
DAC
2006
ACM
16 years 5 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
BIRTHDAY
2009
Springer
15 years 11 months ago
Formal Grammars of Early Language
We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. T...
Shuly Wintner, Alon Lavie, Brian MacWhinney
FOCS
2009
IEEE
15 years 11 months ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi