Sciweavers

2254 search results - page 259 / 451
» Computing the minimal covering set
Sort
View
SACMAT
2006
ACM
16 years 17 days ago
Constraint generation for separation of duty
Separation of Duty (SoD) is widely recognized to be a fundamental principle in computer security. A Static SoD (SSoD) policy states that in order to have all permissions necessary...
Hong Chen, Ninghui Li
HIPC
2005
Springer
16 years 4 days ago
XCAT-C++: Design and Performance of a Distributed CCA Framework
In this paper we describe the design and implementation of a C++ based Common Component Architecture (CCA) framework, XCAT-C++. It can efficiently marshal and unmarshal large data...
Madhusudhan Govindaraju, Michael R. Head, Kenneth ...
ICALP
2005
Springer
16 years 3 days ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
163
Voted
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
16 years 2 days ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
GG
2004
Springer
15 years 12 months ago
Analysis of Metabolic Pathways by Graph Transformation
Biochemical pathways, such as metabolic, regulatory, and signal transduction pathways, constitute complex networks of functional and physical interactions between molecular species...
Francesc Rosselló, Gabriel Valiente