Sciweavers

205 search results - page 31 / 41
» On Approximation Algorithms for Hierarchical MAX-SAT
Sort
View
VISUALIZATION
1997
IEEE
15 years 4 months ago
Multiresolution tetrahedral framework for visualizing regular volume data
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
Yong Zhou, Baoquan Chen, Arie E. Kaufman
CGF
1998
116views more  CGF 1998»
14 years 11 months ago
A Light Hierarchy for Fast Rendering of Scenes with Many Lights
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...
Eric Paquette, Pierre Poulin, George Drettakis
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
15 years 1 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
MOBIHOC
2007
ACM
15 years 11 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
BMCBI
2008
117views more  BMCBI 2008»
14 years 12 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...