3965 search results - page 731 / 793 » Effectivity of Regular Spaces |
141
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
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...
130
Voted
HVEI
2009
15 years 1 months ago
2009
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...
190
Voted
BMCBI
2011
14 years 10 months ago
2011
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...
256
click to vote
TVCG
2012
13 years 5 months ago
2012
—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...
115
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
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 × ...