7930 search results - page 1557 / 1586 » Greedy in Approximation Algorithms |
SIGGRAPH
2000
ACM
14 years 25 days ago
2000
ACM
Many researchers have been arguing that geometry, bump maps, and BRDFs present a hierarchy of detail that should be exploited for efficient rendering purposes. In practice howeve...
SSDBM
2010
IEEE
14 years 24 days ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
FOCS
1999
IEEE
14 years 24 days ago
1999
IEEE
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...
RTSS
1999
IEEE
14 years 23 days ago
1999
IEEE
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...
VLDB
1999
ACM
14 years 22 days ago
1999
ACM
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...