1650 search results - page 185 / 330 » The HOM problem is decidable |
167
Voted
TSP
2011
14 years 11 months ago
2011
—We study a decentralized detection architecture in which each of a set of sensors transmits a highly compressed summary of its observations (a binary message) to a fusion center...
153
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
132
Voted
AAAI
2011
14 years 4 months ago
2011
We address the problem of transferring information learned from experiments to a different environment, in which only passive observations can be collected. We introduce a formal ...
168
click to vote
VMCAI
2012
Springer
14 years 3 days ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
142
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...