Sciweavers

3874 search results - page 502 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 5 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
ICC
2009
IEEE
15 years 11 months ago
Robust Cyclic Space-Frequency Filtering for BICM-OFDM with Outdated CSIT
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
Harry Z. B. Chen, Robert Schober, Wolfgang H. Gers...
IPPS
2009
IEEE
15 years 11 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
FOCS
2008
IEEE
15 years 11 months ago
Hardness of Minimizing and Learning DNF Expressions
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
Subhash Khot, Rishi Saket
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 9 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn