8825 search results - page 61 / 1765 » All for one or one for all |
SODA
1990
ACM
13 years 9 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
NORDSEC
2009
Springer
14 years 2 months ago
2009
Springer
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...
POLICY
2004
Springer
14 years 1 months ago
2004
Springer
Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach ...
UAI
2001
13 years 9 months ago
2001
It is "well known" that in linear models: (1) testable constraints on the marginal distribution of observed variables distinguish certain cases in which an unobserved ca...
CASCON
1996
13 years 9 months ago
1996
Software development managers strive to control all of the factors that might impact the success of their projects. However, not all of these factors have been identified, much le...