Sciweavers

1093 search results - page 120 / 219
» Clustering from Constraint Graphs
Sort
View
173
Voted
APVIS
2011
14 years 3 months ago
Multilevel agglomerative edge bundling for visualizing large graphs
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
Emden R. Gansner, Yifan Hu, Stephen C. North, Carl...
128
Voted
ER
2004
Springer
103views Database» more  ER 2004»
15 years 9 months ago
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Julien Velcin, Jean-Gabriel Ganascia
OPODIS
2004
15 years 5 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
142
Voted
ECCV
2006
Springer
16 years 5 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
128
Voted
TPDS
2008
96views more  TPDS 2008»
15 years 3 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack