1274 search results - page 114 / 255 » New Proofs for |
96
Voted
CORR
2008
Springer
15 years 26 days 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...
115
click to vote
JAIR
2011
14 years 7 months 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...
115
Voted
ESORICS
2011
Springer
14 years 15 days 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...
165
Voted
JMLR
2012
13 years 3 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...
96
Voted
RECOMB
2006
Springer
16 years 1 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...