Sciweavers

463 search results - page 44 / 93
» A General Framework for Graph Sparsification
Sort
View
145
Voted
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 4 months ago
A visual-analytic toolkit for dynamic interaction graphs
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
Xintian Yang, Sitaram Asur, Srinivasan Parthasarat...
156
Voted
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 8 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
113
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 3 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
140
Voted
CVPR
2004
IEEE
16 years 5 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
CVPR
2010
IEEE
16 years 3 days ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen