Sciweavers

2520 search results - page 190 / 504
» The complexity of approximating entropy
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 13 days ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
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 ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
51
Voted
JSAC
2008
91views more  JSAC 2008»
14 years 11 months ago
A novel receiver architecture for single-carrier transmission over time-varying channels
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...
Zijian Tang, Geert Leus
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
14 years 10 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
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...
Mihir Bellare, Oded Goldreich, Madhu Sudan
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
14 years 11 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
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...
M. C. Campi, A. Lecchini, Sergio M. Savaresi
JMLR
2008
159views more  JMLR 2008»
14 years 11 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
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 ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin