2497 search results - page 184 / 500 » Requirements for models of achievable routing |
173
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
219
click to vote
TWC
2008
15 years 6 months ago
2008
Abstract-- Multiuser diversity gains can be achieved by assigning channels to users with better channel quality in multiuser systems. To avoid the extensive information exchange re...
137
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
159
click to vote
IWACA
1994
15 years 10 months ago
1994
Computers are ever more thought of to support cooperative work over distances. Thus tele-cooperation tools and environments are needed which bring the meeting and joint-working ont...
150
click to vote
VMV
2008
15 years 8 months ago
2008
We present in this paper a GPU-accelerated particle filter based on pixel-level segmentation and matching, for real-time object tracking. The proposed method achieves real-time pe...