2654 search results - page 192 / 531 » On Pairing Inversion Problems |
173
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
146
click to vote
IJNSEC
2008
15 years 6 months ago
2008
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
134
click to vote
COGSCI
2004
15 years 6 months ago
2004
It is easy to construct pairs of sentences X, Y that lead many people to ascribe higher probability to the conjunction X-and-Y than to the conjuncts X, Y. Whether an error is ther...
141
click to vote
SIAMDM
2010
15 years 1 months ago
2010
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
194
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...