1722 search results - page 115 / 345 » On the sample mean of graphs |
160
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
171
click to vote
IFIP12
2007
15 years 7 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
182
click to vote
JGAA
2002
15 years 6 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
144
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
159
click to vote
ISMIS
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...