Sciweavers

3965 search results - page 731 / 793
» Effectivity of Regular Spaces
Sort
View
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 7 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
HVEI
2009
13 years 7 months ago
A perceptual evaluation of 3D unsharp masking
Much research has gone into developing methods for enhancing the contrast of displayed 3D scenes. In the current study, we investigated the perceptual impact of an algorithm recen...
Matthias Ihrke, Tobias Ritschel, Kaleigh Smith, Th...
BMCBI
2011
13 years 5 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
TVCG
2012
210views Hardware» more  TVCG 2012»
12 years 11 days ago
Scalable Multivariate Volume Visualization and Analysis Based on Dimension Projection and Parallel Coordinates
—In this paper, we present an effective and scalable system for multivariate volume data visualization and analysis with a novel transfer function interface design that tightly c...
Hanqi Guo, He Xiao, Xiaoru Yuan
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 10 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...