Sciweavers

232 search results - page 10 / 47
» Dynamic Graph Clustering Using Minimum-Cut Trees
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
CVPR
2007
IEEE
14 years 8 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
GVD
2009
128views Database» more  GVD 2009»
13 years 4 months ago
A Self-Adaptive Insert Strategy for Content-Based Multidimensional Database Storage
In this paper, we present the current development progress of our dynamic insert strategy based on the Intelligent Cluster Index (ICIx), which is a new type of multidimensional da...
Sebastian Leuoth, Wolfgang Benn
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 6 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
CGF
2008
110views more  CGF 2008»
13 years 6 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl