1743 search results - page 139 / 349 » Generalized Modal Satisfiability |
181
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
275
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
192
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
147
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This work studies distributed linear transmission strategies for the multiple-input multiple-output (MIMO) interference channel with multiple concurrent links. We introduce the no...
218
click to vote
JMLR
2012
13 years 8 months ago
2012
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...