404 search results - page 21 / 81 » Robust Multiparty Computation with Linear Communication Comp... |
ISVC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
NOSSDAV
2005
Springer
14 years 1 months ago
2005
Springer
P2P systems inherently have high scalability, robustness and fault tolerance because there is no centralized server and the network self-organizes itself. This is achieved at the ...
FOCS
2002
IEEE
14 years 17 days ago
2002
IEEE
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
WICON
2008
13 years 9 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...