2060 search results - page 276 / 412 » Some Applications of Coding Theory in Computational Complexi... |
160
click to vote
WEBNET
1997
15 years 5 months ago
1997
The health care industry in the United States has been experiencing substantial and ever increasing cost pressures. At the same time, many forces are revolutionizing the way healt...
147
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
131
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
156
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
149
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...