1274 search results - page 114 / 255 » New Proofs for |
153
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
169
click to vote
JAIR
2011
15 years 22 days ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
183
click to vote
ESORICS
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Cloud computing is a new computing paradigm that is gaining increased popularity. More and more sensitive user data are stored in the cloud. The privacy of users’ acces...
235
click to vote
JMLR
2012
13 years 8 months ago
2012
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
152
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...