Sciweavers

2465 search results - page 172 / 493
» Automata on Linear Orderings
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 7 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICFEM
2009
Springer
14 years 5 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 10 months ago
Rational stochastic languages
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
François Denis, Yann Esposito
BMVC
2010
13 years 8 months ago
Additive Update Predictors in Active Appearance Models
The Active Appearance Model (AAM) provides an efficient method for localizing objects that vary in both shape and texture, and uses a linear regressor to predict updates to model ...
Philip A. Tresadern, Patrick Sauer, Timothy F. Coo...
MFCS
2009
Springer
14 years 2 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn