2520 search results - page 190 / 504 » The complexity of approximating entropy |
262
Voted
ICDE
2002
IEEE
16 years 6 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
JSAC
2008
15 years 4 months ago
2008
In this paper, we present a single-carrier transceiver for rapidly time-varying channels, where the equalization step is implemented in the frequency domain. When the channel abide...
144
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
135
click to vote
AUTOMATICA
2002
15 years 4 months ago
2002
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
164
click to vote
JMLR
2008
15 years 4 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...