Sciweavers

920 search results - page 75 / 184
» Computing the Frequency of Partial Orders
Sort
View
SAC
2010
ACM
15 years 4 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato
FGR
2004
IEEE
135views Biometrics» more  FGR 2004»
15 years 1 months ago
Bayesian Fusion of Hidden Markov Models for Understanding Bimanual Movements
Understanding hand and body gestures is a part of a wide spectrum of current research in computer vision and Human-Computer Interaction. A part of this can be the recognition of m...
Atid Shamaie, Alistair Sutherland
CISIS
2011
IEEE
13 years 9 months ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog
CVBIA
2005
Springer
15 years 3 months ago
A Hybrid Eulerian-Lagrangian Approach for Thickness, Correspondence, and Gridding of Annular Tissues
—We present a novel approach to efficiently compute thickness, correspondence, and gridding of tissues between two simply connected boundaries. The solution of Laplace’s equat...
Kelvin R. Rocha, Anthony J. Yezzi, Jerry L. Prince
JSYML
2007
100views more  JSYML 2007»
14 years 9 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore