705 search results - page 91 / 141 » Proximity Cluster Trees |
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
BMCBI
2006
13 years 7 months ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
CIVR
2007
Springer
14 years 1 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...