Sciweavers

7150 search results - page 1401 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
133
Voted
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 4 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
FOCS
1999
IEEE
15 years 4 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
RTSS
1999
IEEE
15 years 4 months ago
A Scalable Solution to the Multi-Resource QoS Problem
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
Chen Lee, John P. Lehoczky, Daniel P. Siewiorek, R...
VLDB
1999
ACM
140views Database» more  VLDB 1999»
15 years 4 months ago
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
Arnd Christian König, Gerhard Weikum
161
Voted
PLDI
1997
ACM
15 years 4 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
« Prev « First page 1401 / 1430 Last » Next »