Sciweavers

8298 search results - page 1462 / 1660
» On the Complexity of Numerical Analysis
Sort
View
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 7 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 6 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 6 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
PODS
2008
ACM
170views Database» more  PODS 2008»
16 years 6 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
« Prev « First page 1462 / 1660 Last » Next »