Sciweavers

2252 search results - page 364 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
DCC
2005
IEEE
14 years 8 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
ICDCS
2009
IEEE
14 years 6 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
MOBICOM
2009
ACM
14 years 3 months ago
Achievable throughput of multiple access spectrum systems based on cognitive relay
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
Wei Wang, Baochun Li, Li Yu
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
SASO
2007
IEEE
14 years 3 months ago
STORM: A Secure Overlay for P2P Reputation Management
A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite m...
Aina Ravoaja, Emmanuelle Anceaume