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....
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...
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...
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...
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)....