1156 search results - page 62 / 232 » Compositional Methods for Information-Hiding |
IOR
2011
13 years 2 months ago
2011
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The selection of weak classifiers is critical to the success of boosting techniques. Poor weak classifiers do not perform better than random guess, thus cannot help decrease the t...
FORTE
2009
13 years 5 months ago
2009
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Web Usage Mining enables new understanding of user goals on the Web. This understanding has broad applications, and traditional mining techniques such as association rules have bee...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
The Vienna Component Framework (VCF) supports the interoperability and composability of components across different component models, a facility that is lacking in existing compon...