296 search results - page 42 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
101
click to vote
SACMAT
2006
ACM
15 years 3 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
75
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
ISBI
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper develops an algorithm to detect abnormalities of small animals' transplanted hearts in MRI, at early stage of rejection when the hearts do not display prominent ab...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...