Sciweavers

Share
67 search results - page 14 / 14
» Information Theoretic Optimal Broadband Matching for Communi...
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
11 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ICDCS
2009
IEEE
12 years 2 months ago
Roadcast: A Popularity Aware Content Sharing Scheme in VANETs
Content sharing through vehicle-to-vehicle communication can help people find their interested content on the road. In VANETs, due to limited contact duration and unreliable wire...
Yang Zhang, Jing Zhao, Guohong Cao
books