3228 search results - page 389 / 646 » Computationally Sound Proofs |
131
Voted
DCC
2002
IEEE
16 years 3 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
101
Voted
DCC
2001
IEEE
16 years 3 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
136
click to vote
SOFSEM
2010
Springer
16 years 21 days ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
128
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
116
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...