522 search results - page 35 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
127
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
SIAMJO
2008
15 years 2 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
127
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
152
click to vote
GG
2008
Springer
15 years 4 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
125
click to vote
TIT
2011
14 years 10 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...