Sciweavers

17082 search results - page 3126 / 3417
» Abstractions for Mobile Computation
Sort
View
TNN
2008
105views more  TNN 2008»
15 years 6 months ago
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
Shuiwang Ji, Jieping Ye
TNN
2008
132views more  TNN 2008»
15 years 6 months ago
Just-in-Time Adaptive Classifiers - Part I: Detecting Nonstationary Changes
Abstract--The stationarity requirement for the process generating the data is a common assumption in classifiers' design. When such hypothesis does not hold, e.g., in applicat...
Cesare Alippi, Manuel Roveri
JCP
2007
122views more  JCP 2007»
15 years 6 months ago
Converting Group Key Agreement Protocol into Password-Based Setting - Case Study
Abstract— Converting a secure group key agreement protocol into password-based setting is not a trivial task. The security of a password-based scheme hinges on preventing diction...
Ratna Dutta
TOPLAS
2008
101views more  TOPLAS 2008»
15 years 6 months ago
Verifying policy-based web services security
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
TOPNOC
2008
15 years 6 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
« Prev « First page 3126 / 3417 Last » Next »