Sciweavers

244 search results - page 2 / 49
» Analyzing the performance of randomized information sharing
Sort
View
MOBIHOC
2008
ACM
14 years 4 months ago
Analyzing DISH for multi-channel MAC protocols in wireless networks
For long, node cooperation has been exploited as a data relaying mechanism. However, the wireless channel allows for much richer interaction between nodes. One such scenario is in...
Tie Luo, Mehul Motani, Vikram Srinivasan
AAAI
2008
13 years 7 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
JCST
2010
189views more  JCST 2010»
13 years 4 days ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ICPP
2006
IEEE
13 years 11 months ago
Parallel Information Extraction on Shared Memory Multi-processor System
Text Mining is one of the best solutions for today and the future’s information explosion. With the development of modern processor technologies, it will be a mass market deskto...
Jiulong Shan, Yurong Chen, Qian Diao, Yimin Zhang
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...