5084 search results - page 319 / 1017 » Proving Possibility Properties |
156
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
142
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
Unlinkability, the property that prevents an adversary recognizing whether outputs are from the same user, is an important concept in RFID. There are many proposed schemes that pr...
177
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
—A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing ...
178
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper considers a coding scheme for data transmission over erasure channels which is also known as multiple description coding. The LMMSE prefilter method of Romano [1] is r...
138
Voted
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
In this paper we enrich FIEVeL (a modelling language for institutions amenable to model checking) with new constructs to describe norms and sanctions. Moreover, we present a speci...