3757 search results - page 302 / 752 » The overlap number of a graph |
165
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 (...
152
click to vote
ICES
2003
Springer
15 years 12 months ago
2003
Springer
A review is given of approaches to growing neural networks and electronic circuits. A new method for growing graphs and circuits using a developmental process is discussed. The met...
167
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...
155
click to vote
ICPP
1997
IEEE
15 years 11 months ago
1997
IEEE
Optamzztng compalataon as very amportant for generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon t...
174
click to vote
ACIIDS
2009
IEEE
15 years 10 months ago
2009
IEEE
Inter domain service routing is an element in the success of Next Generation Network. Service requests, such as the INVITE request in Session Initiation Protocol [21] may need to ...