Sciweavers

1024 search results - page 112 / 205
» Compositional Methods for Probabilistic Systems
Sort
View
EUROCRYPT
2004
Springer
14 years 1 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
ICWS
2010
IEEE
13 years 9 months ago
Variability Modeling and QoS Analysis of Web Services Orchestrations
The ever-growing choice in diverse services is making service orchestration variability an essential aspect of a composite web service. Influence of this variation on the Quality o...
Ajay Kattepur, Sagar Sen, Benoit Baudry, Albert Be...
IJCNLP
2005
Springer
14 years 1 months ago
Chunking Using Conditional Random Fields in Korean Texts
We present a method of chunking in Korean texts using conditional random fields (CRFs), a recently introduced probabilistic model for labeling and segmenting sequence of data. In a...
Yong-Hun Lee, Mi-Young Kim, Jong-Hyeok Lee
CVPR
2000
IEEE
14 years 10 months ago
Representation and Optimal Recognition of Human Activities
Towards the goal of realizing a generic automatichuman activity recognition system, a new formalism is proposed. Activities are described by a chained hierarchical representation ...
François Brémond, Ramakant Nevatia, ...
MOBISYS
2006
ACM
14 years 7 months ago
LIGER: implementing efficient hybrid security mechanisms for heterogeneous sensor networks
The majority of security schemes available for sensor networks assume deployment in areas without access to a wired infrastructure. More specifically, nodes in these networks are ...
Patrick Traynor, Raju Kumar, Hussain Bin Saad, Guo...