Sciweavers

2080 search results - page 96 / 416
» Measuring empirical computational complexity
Sort
View
IMC
2009
ACM
15 years 6 months ago
On calibrating enterprise switch measurements
The complexity of modern enterprise networks is ever-increasing, and our understanding of these important networks is not keeping pace. Our insight into intra-subnet traffic (sta...
Boris Nechaev, Vern Paxson, Mark Allman, Andrei Gu...
BMCBI
2005
94views more  BMCBI 2005»
14 years 11 months ago
Measuring similarities between transcription factor binding sites
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
Szymon M. Kielbasa, Didier Gonze, Hanspeter Herzel
TRUST
2010
Springer
15 years 5 months ago
Beyond Kernel-Level Integrity Measurement: Enabling Remote Attestation for the Android Platform
Abstract. Increasing adoption of smartphones in recent times has begun to attract more and more malware writers towards these devices. Among the most prominent and widely adopted o...
Mohammad Nauman, Sohail Khan, Xinwen Zhang, Jean-P...
BMCBI
2008
78views more  BMCBI 2008»
14 years 12 months ago
Deducing topology of protein-protein interaction networks from experimentally measured sub-networks
Background: Protein-protein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallym...
Ling Yang, Thomas M. Vondriska, Zhangang Han, W. R...
PRL
2007
138views more  PRL 2007»
14 years 11 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh