Sciweavers

4917 search results - page 936 / 984
» Software Engineering is Not Computer Science
Sort
View
CCS
2006
ACM
14 years 1 months ago
RoleMiner: mining roles using subset enumeration
Role engineering, the task of defining roles and associating permissions to them, is essential to realize the full benefits of the role-based access control paradigm. Essentially,...
Jaideep Vaidya, Vijayalakshmi Atluri, Janice Warne...
COLT
2008
Springer
13 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
AI
2010
Springer
13 years 10 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
BMCBI
2007
146views more  BMCBI 2007»
13 years 10 months ago
Spatial location and its relevance for terminological inferences in bio-ontologies
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
Stefan Schulz, Kornél G. Markó, Udo ...
JCM
2007
131views more  JCM 2007»
13 years 9 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze