Sciweavers

1477 search results - page 62 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
148
Voted
SIROCCO
2001
15 years 6 months ago
Cycle Covering
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
Jean-Claude Bermond, Lilian Chacon, David Coudert,...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
15 years 3 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
IJMMS
2007
166views more  IJMMS 2007»
15 years 5 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...
127
Voted
DAGM
2004
Springer
15 years 10 months ago
Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
Daniel Keysers, Thomas Deselaers, Hermann Ney
COMPGEOM
2011
ACM
14 years 8 months ago
Metric graph reconstruction from noisy data
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
Mridul Aanjaneya, Frédéric Chazal, D...