Sciweavers

332 search results - page 26 / 67
» Space Complexity vs. Query Complexity
Sort
View
SIGGRAPH
2010
ACM
14 years 2 months ago
Line space gathering for single scattering in large scenes
We present an efficient technique to render single scattering in large scenes with reflective and refractive objects and homogeneous participating media. Efficiency is obtained...
Xin Sun, Kun Zhou, Stephen Lin, Baining Guo
ICALP
2005
Springer
14 years 3 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
PAMI
2006
132views more  PAMI 2006»
13 years 9 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
14 years 3 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
VLDB
2007
ACM
103views Database» more  VLDB 2007»
14 years 10 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa