Sciweavers

3934 search results - page 667 / 787
» Approximate Schedulability Analysis
Sort
View
WWW
2010
ACM
16 years 1 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
CVPR
2009
IEEE
16 years 1 months ago
3D morphable face models revisited
In this paper we revisit the process of constructing a high resolution 3D morphable model of face shape variation. We demonstrate how the statistical tools of thin-plate splines a...
Ankur Patel, William A. P. Smith
ESORICS
2009
Springer
16 years 1 months ago
Hide and Seek in Time - Robust Covert Timing Channels
Abstract. Covert timing channels aim at transmitting hidden messages by controlling the time between transmissions of consecutive payload packets in overt network communication. Pr...
Yali Liu, Dipak Ghosal, Frederik Armknecht, Ahmad-...
ICC
2009
IEEE
233views Communications» more  ICC 2009»
16 years 1 months ago
Detecting Primary User Emulation Attacks in Dynamic Spectrum Access Networks
— In this paper, we present an analytical model as well as a practical mechanism to detect denial of service (DoS) attacks on secondary users in dynamic spectrum access (DSA) net...
Z. Jin, S. Anand, K. P. Subbalakshmi
RECONFIG
2009
IEEE
182views VLSI» more  RECONFIG 2009»
16 years 1 months ago
Scalability Studies of the BLASTn Scan and Ungapped Extension Functions
BLASTn is a ubiquitous tool used for large scale DNA analysis. Detailed profiling tests reveal that the most computationally intensive sections of the BLASTn algorithm are the sc...
Siddhartha Datta, Ron Sass