463 search results - page 37 / 93 » The Most Reliable Subgraph Problem |
102
click to vote
MM
2000
ACM
15 years 6 months ago
2000
ACM
With the rapid growth of broadband network, distribution of multimedia via Internet is a must way to go. Content protection has become one of the most significant and challenging ...
ASIACRYPT
1999
Springer
15 years 6 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
116
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
112
Voted
DNA
2006
Springer
15 years 5 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
121
Voted
ISBI
2007
IEEE
15 years 8 months ago
2007
IEEE
Tagged magnetic resonance (MR) imaging makes it possible to image the motion of tissues such as the muscles found in the heart and tongue. The harmonic phase (HARP) method largely...