596 search results - page 86 / 120 » Complexity Analysis by Graph Rewriting |
AAECC
2006
Springer
13 years 12 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
DPD
2007
13 years 8 months ago
2007
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
TKDE
2010
13 years 6 months ago
2010
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...