Sciweavers

5221 search results - page 650 / 1045
» An On-line Problem Database
Sort
View
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 11 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
IUI
1997
ACM
15 years 11 months ago
Automating a Classification Task Based on an Augmented Thesaurus
Most classification tasks that have been tackled for automation are ones involving complex chains of causal reasoning. However, our daily lives are filled with simple classificati...
Eunok Paek, Hye-Jeong Jeon
SIGGRAPH
1997
ACM
15 years 11 months ago
Rendering complex scenes with memory-coherent ray tracing
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
Matt Pharr, Craig E. Kolb, Reid Gershbein, Pat Han...
SIGMOD
1996
ACM
112views Database» more  SIGMOD 1996»
15 years 11 months ago
Performance Tradeoffs for Client-Server Query Processing
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
Michael J. Franklin, Björn Þór J...
SIGMOD
1996
ACM
97views Database» more  SIGMOD 1996»
15 years 11 months ago
Bifocal Sampling for Skew-Resistant Join Size Estimation
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classi es tuples in each relation into two group...
Sumit Ganguly, Phillip B. Gibbons, Yossi Matias, A...