Sciweavers

41 search results - page 4 / 9
» Efficient Approximate Visibility Query in Large Dynamic Envi...
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CGA
1999
13 years 7 months ago
Dynamics Modeling and Culling
emsintovirtualenvironments,whileabstracting the modeling process as much as possible. To achieve efficiency,weconcentrateoncullingdynamicalsystems: if the system is not in view, we...
Stephen Chenney, Jeffrey Ichnowski, David A. Forsy...
CGF
2010
148views more  CGF 2010»
13 years 7 months ago
Two Methods for Fast Ray-Cast Ambient Occlusion
Ambient occlusion has proven to be a useful tool for producing realistic images, both in offline rendering and interactive applications. In production rendering, ambient occlusion...
Samuli Laine, Tero Karras
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 12 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers