Sciweavers

60 search results - page 3 / 12
» A Graph Clustering Approach to Weak Motif Recognition
Sort
View
AAIM
2008
Springer
119views Algorithms» more  AAIM 2008»
14 years 1 months ago
Engineering Comparators for Graph Clusterings
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
Daniel Delling, Marco Gaertler, Robert Görke,...
GBRPR
2007
Springer
13 years 11 months ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 7 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
AAAI
2006
13 years 8 months ago
Identification and Evaluation of Weak Community Structures in Networks
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
Jianhua Ruan, Weixiong Zhang
ICCV
2007
IEEE
14 years 9 months ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley