1538 search results - page 229 / 308 » Spectral Techniques in Graph Algorithms |
116
click to vote
BPM
2005
Springer
15 years 7 months ago
2005
Springer
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
103
click to vote
SENSYS
2004
ACM
15 years 6 months ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
136
click to vote
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
125
click to vote
IWPEC
2004
Springer
15 years 6 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
AAECC
2006
Springer
15 years 5 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,...