522 search results - page 97 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
130
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
138
Voted
IPSN
2011
Springer
14 years 6 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
153
Voted
UAI
2007
15 years 3 months ago
2007
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
128
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
129
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...