16404 search results - page 776 / 3281 » A set coverage problem |
172
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Dynamic observers can switch sensors on or off, thus ...
141
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...
197
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
170
click to vote
AMC
2006
15 years 7 months ago
2006
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
187
Voted
DM
2006
15 years 7 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...