Sciweavers

3134 search results - page 120 / 627
» Computing full disjunctions
Sort
View
110
Voted
ASM
2008
ASM
15 years 4 months ago
Modelling Attacker's Knowledge for Cascade Cryptographic Protocols
We address the proof-based development of cryptographic protocols satisfying security properties. Communication channels are supposed to be unsafe. Analysing cryptographic protocol...
Nazim Benassa
123
Voted
EDOC
2008
IEEE
15 years 4 months ago
Runtime Monitoring of Message-Based Workflows with Data
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
Sylvain Hallé, Roger Villemaire
117
Voted
NIPS
2007
15 years 4 months ago
Non-parametric Modeling of Partially Ranked Data
Statistical models on full and partial rankings of n items are often of limited practical use for large n due to computational consideration. We explore the use of non-parametric ...
Guy Lebanon, Yi Mao
100
Voted
HCI
2001
15 years 4 months ago
Intelligent interfaces for universal access: challenges and promise
This article outlines some challenges and opportunities in the area of universal access to intelligent interfaces. Technological advances in computing and communication together w...
Mark T. Maybury
110
Voted
GD
2008
Springer
15 years 3 months ago
Tree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...