1528 search results - page 55 / 306 » On Signatures for Communication Graphs |
151
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
146
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
152
click to vote
IEEECIT
2010
IEEE
15 years 3 months ago
2010
IEEE
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
145
click to vote
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
155
click to vote
COLOGNETWENTE
2007
15 years 6 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...