Sciweavers

69 search results - page 7 / 14
» Proximity Algorithms for Nearly-Doubling Spaces
Sort
View
ICPP
2006
IEEE
14 years 1 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
CGF
1998
110views more  CGF 1998»
13 years 7 months ago
Adaptive Supersampling in Object Space Using Pyramidal Rays
We introduce a new approach to three important problems in ray tracing: antialiasing, distributed light sources, and fuzzy reflections of lights and other surfaces. For antialias...
Jon D. Genetti, Dan Gordon, G. Williams
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 9 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
ICTAI
2006
IEEE
14 years 1 months ago
On the Relationships between Clustering and Spatial Co-location Pattern Mining
The goal of spatial co-location pattern mining is to find subsets of spatial features frequently located together in spatial proximity. Example co-location patterns include servi...
Yan Huang, Pusheng Zhang
IJIS
2008
123views more  IJIS 2008»
13 years 7 months ago
Algorithms of nonlinear document clustering based on fuzzy multiset model
Abstract: Fuzzy multiset is applicable as a model of information retrieval because it has the mathematical structure which expresses the number and the degree of attribution of an ...
Kiyotaka Mizutani, Ryo Inokuchi, Sadaaki Miyamoto