Sciweavers

182 search results - page 12 / 37
» Approximate Colored Range Queries
Sort
View
PVLDB
2008
100views more  PVLDB 2008»
13 years 8 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
NIPS
2008
13 years 10 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
INFOVIS
1999
IEEE
14 years 22 days ago
Efficient Multi-Object Dynamic Query Histograms
Dynamic Queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects an...
Mark Derthick, James Harrison, Andrew Moore, Steve...
SCIA
2007
Springer
131views Image Analysis» more  SCIA 2007»
14 years 2 months ago
Performance Comparison of Techniques for Approximating Image-Based Lighting by Directional Light Sources
Abstract. Image-Based Lighting (IBL) has become a very popular approach in computer graphics. In essence IBL is based on capturing the illumination conditions in a scene in an omni...
Claus B. Madsen, Rune E. Laursen
FOCS
2002
IEEE
14 years 1 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan