1743 search results - page 182 / 349 » Generalized Modal Satisfiability |
119
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because i...
231
Voted
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
121
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
131
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
110
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
We study how to automatically extract tourist trips from large volumes of geo-tagged photographs. Working with more than 8 million of these photographs that are publicly available...