Sciweavers

420 search results - page 37 / 84
» Generating random regular graphs
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
DM
2011
264views Education» more  DM 2011»
13 years 2 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
ICML
2009
IEEE
14 years 8 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang
DCC
2011
IEEE
13 years 2 months ago
Video Compressed Sensing with Multihypothesis
The compressed-sensing recovery of video sequences driven by multihypothesis predictions is considered. Specifically, multihypothesis predictions of the current frame are used to...
Eric W. Tramel, James E. Fowler
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang