Sciweavers

101 search results - page 5 / 21
» A Classification of Time and or Probability Dependent Securi...
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
COMPSAC
2004
IEEE
13 years 11 months ago
Services-Oriented Dynamic Reconfiguration Framework for Dependable Distributed Computing
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
Wei-Tek Tsai, Weiwei Song, Raymond A. Paul, Zhibin...
ISMIR
2005
Springer
145views Music» more  ISMIR 2005»
14 years 29 days ago
An Investigation of Feature Models for Music Genre Classification Using the Support Vector Classifier
In music genre classification the decision time is typically of the order of several seconds, however, most automatic music genre classification systems focus on short time feat...
Anders Meng, John Shawe-Taylor
JALC
2006
61views more  JALC 2006»
13 years 7 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
IEEEARES
2009
IEEE
13 years 5 months ago
Quantitative Analysis of Secure Information Flow via Probabilistic Semantics
We present an automatic analyzer for measuring information flow within software systems. In this paper, we quantify leakage in terms of information theory and incorporate this comp...
Chunyan Mu, David Clark