8413 search results - page 233 / 1683 » Ordering Problem Subgoals |
113
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instan...
180
Voted
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
120
Voted
TIT
2010
14 years 7 months ago
2010
Abstract-- The problem of universal simulation given a training sequence is studied both in a stochastic setting and for individual sequences. In the stochastic setting, the traini...
94
Voted
TSP
2010
14 years 7 months ago
2010
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
126
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...