Sciweavers

870 search results - page 105 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
CSE
2009
IEEE
15 years 4 months ago
First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL
—Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often i...
Elizabeth M. Bonsignore, Cody Dunne, Dana Rotman, ...
MICCAI
2005
Springer
15 years 3 months ago
Spectral Clustering Algorithms for Ultrasound Image Segmentation
Abstract. Image segmentation algorithms derived from spectral clustering analysis rely on the eigenvectors of the Laplacian of a weighted graph obtained from the image. The NCut cr...
Neculai Archip, Robert Rohling, Peter Cooperberg, ...
SBBD
2007
116views Database» more  SBBD 2007»
14 years 11 months ago
A Hypergraph Model for Computing Page Reputation on Web Collections
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...
Klessius Berlt, Edleno Silva de Moura, André...
CVPR
2008
IEEE
15 years 12 months ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
PLDI
2011
ACM
14 years 22 days ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...