Sciweavers

14078 search results - page 2517 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
MOBIHOC
2010
ACM
15 years 4 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
MOBIHOC
2010
ACM
15 years 4 months ago
Whirlpool routing for mobility
We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP's design is that data traffic c...
Jung Woo Lee, Branislav Kusy, Tahir Azim, Basem Sh...
CVPR
2011
IEEE
15 years 2 months ago
RUNE-Tag: a High Accuracy Fiducial Marker with Strong Occlusion Resilience
Over the last decades fiducial markers have provided widely adopted tools to add reliable model-based features into an otherwise general scene. Given their central role in many c...
Filippo Bergamasco, Andrea Albarelli, Andrea Torse...
SIGOPS
2011
210views Hardware» more  SIGOPS 2011»
15 years 1 months ago
Small trusted primitives for dependable systems
Secure, fault-tolerant distributed systems are difficult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault toleran...
Petros Maniatis, Byung-Gon Chun
NOSSDAV
2009
Springer
16 years 1 months ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
« Prev « First page 2517 / 2816 Last » Next »