Sciweavers

792 search results - page 23 / 159
» Computing Iceberg Queries Efficiently
Sort
View
TOG
2008
163views more  TOG 2008»
14 years 9 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
15 years 10 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
ALT
1997
Springer
15 years 1 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
ICDE
2007
IEEE
205views Database» more  ICDE 2007»
15 years 11 months ago
Multi-source Skyline Query Processing in Road Networks
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
Ke Deng, Xiaofang Zhou, Heng Tao Shen
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 9 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan