2150 search results - page 422 / 430 » On a restricted cross-intersection problem |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In a number of signal processing applications, problem formulations based on the 1 norm as a sparsity inducing signal prior lead to simple algorithms with good performance. Howeve...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
IANDC
2011
13 years 2 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
es of circulant matrices. Our class is broader than just circulants, and we study patterned systems using abstract algebra, specifically the observation that a set of matrices with...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...