3678 search results - page 233 / 736 » On the Stable Paths Problem |
118
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
148
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
130
click to vote
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
126
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
139
click to vote
CRYPTO
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...