Sciweavers

6926 search results - page 1333 / 1386
» A More Effective CEFF
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
INFOCOM
2009
IEEE
15 years 6 months ago
Distilling Superior Peers in Large-Scale P2P Streaming Systems
Abstract—In large-scale peer-to-peer (P2P) live streaming systems with a limited supply of server bandwidth, increasing the amount of upload bandwidth supplied by peers becomes c...
Zimu Liu, Chuan Wu, Baochun Li, Shuqiao Zhao
IPPS
2009
IEEE
15 years 6 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
AIED
2009
Springer
15 years 6 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
ASIACRYPT
2009
Springer
15 years 6 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
« Prev « First page 1333 / 1386 Last » Next »