398 search results - page 77 / 80 » Ant Algorithm for the Graph Matching Problem |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
ICALP
2010
Springer
14 years 12 days ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
COMCOM
1998
13 years 7 months ago
1998
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
BIBE
2006
IEEE
14 years 1 months ago
2006
IEEE
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...