2436 search results - page 102 / 488 » Comonadic Notions of Computation |
118
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
122
Voted
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using t...
129
click to vote
ICECCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Design of embedded systems is a complex task that requires design cycles founded upon formal notation, so that the synthesis from specification to implementation can be carried ou...
146
Voted
DAGM
2007
Springer
15 years 7 months ago
2007
Springer
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
138
Voted
AAAI
2008
15 years 6 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...