1067 search results - page 50 / 214 » Probabilistic regular graphs |
137
Voted
LICS
2012
IEEE
13 years 2 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
109
click to vote
UAI
2008
15 years 1 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
114
Voted
STOC
2001
ACM
16 years 24 days ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
91
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
69
Voted
MICCAI
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we propose a unified framework for computing atlases from manually labeled data at various degrees of "sharpness" and the joint registration-segmentation o...