1162 search results - page 80 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
JMLR
2006
13 years 8 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
CVPR
2010
IEEE
14 years 19 days ago
2010
IEEE
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
DATE
1997
IEEE
14 years 15 days ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
GD
2005
Springer
14 years 1 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We address the issue of providing highly informative annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate ...