Sciweavers

32545 search results - page 602 / 6509
» Data Structures and Algorithms
Sort
View
VISUALIZATION
1998
IEEE
15 years 11 months ago
Isosurface extraction in time-varying fields using a temporal hierarchical index tree
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
Han-Wei Shen
CGF
2008
227views more  CGF 2008»
15 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 8 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CGI
1998
IEEE
15 years 11 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...