Sciweavers

1496 search results - page 236 / 300
» Definability of Initial Segments
Sort
View
ICML
2004
IEEE
16 years 6 months ago
Generative modeling for continuous non-linearly embedded visual inference
Many difficult visual perception problems, like 3D human motion estimation, can be formulated in terms of inference using complex generative models, defined over high-dimensional ...
Cristian Sminchisescu, Allan D. Jepson
132
Voted
SIGSOFT
2005
ACM
16 years 6 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
CHI
2008
ACM
16 years 5 months ago
The associative pda 2.0
In this paper I describe the Associative PDA 2.0, a mobile system for Personal Information Management (PIM), based on an associative information network. In addition to associate ...
Eileen Falke
CADE
2008
Springer
16 years 5 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
16 years 5 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...