3008 search results - page 238 / 602 » Independence in connected graphs |
136
click to vote
DASFAA
2007
IEEE
16 years 1 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
191
click to vote
ICCBR
2007
Springer
16 years 24 days ago
2007
Springer
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
164
click to vote
ECCV
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
166
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
143
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...