4485 search results - page 97 / 897 » Equivalences on Observable Processes |
103
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
ACTA
1998
15 years 2 months ago
1998
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
111
click to vote
TIT
2002
15 years 2 months ago
2002
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
125
click to vote
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational eq...
133
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper deals with the detection of a continuous random process described by an Ornstein-Uhlenbeck (O-U) stochastic differential equation. Randomly spaced sensors or equivalent...