Sciweavers

28888 search results - page 5429 / 5778
» Computability and complexity in analysis
Sort
View
SC
2009
ACM
15 years 11 months ago
FACT: fast communication trace collection for parallel applications through program slicing
A proper understanding of communication patterns of parallel applications is important to optimize application performance and design better communication subsystems. Communicatio...
Jidong Zhai, Tianwei Sheng, Jiangzhou He, Wenguang...
WISEC
2009
ACM
15 years 11 months ago
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Recent studies show that network coding can provide significant benefits to network protocols, such as increased throughput, reduced network congestion, higher reliability, and ...
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
ASIACRYPT
2009
Springer
15 years 11 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...
IWCMC
2009
ACM
15 years 11 months ago
On fault tolerant ad hoc network design
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, e...
Wasim El-Hajj, Hazem Hajj, Zouheir Trabelsi
JCDL
2009
ACM
133views Education» more  JCDL 2009»
15 years 11 months ago
EnTag: enhancing social tagging for discovery
The EnTag (Enhanced Tagging for Discovery) project investigated the effect on indexing and retrieval when using only social tagging versus when using social tagging in combination...
Koraljka Golub, Jim Moon, Douglas Tudhope, Catheri...
« Prev « First page 5429 / 5778 Last » Next »