Sciweavers

94 search results - page 11 / 19
» Randomization in traffic information sharing systems
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
ICPPW
2005
IEEE
14 years 1 months ago
Content Oriented Communications for Emergencies in Wireless Environments
In the conventional WWW search or P2P file sharing systems, users search for some information by using the Explicit Information such as keywords, addresses or content names. Howev...
Kazuya Sakai, Hiroki Nakano, Akiko Nakaniwa, Hiroy...
GROUP
2007
ACM
13 years 11 months ago
That's what friends are for: facilitating 'who knows what' across group boundaries
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
N. Sadat Shami, Y. Connie Yuan, Dan Cosley, Ling X...
MM
2006
ACM
181views Multimedia» more  MM 2006»
14 years 1 months ago
Peer-to-peer multimedia applications
In both academia and industry, peer-to-peer (P2P) applications have attracted great attention. Peer-to-peer file sharing applications, such as Napster, Gnutella, Kazaa, BitTorrent...
Jin Li
TIT
2008
87views more  TIT 2008»
13 years 7 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga