Sciweavers

175 search results - page 9 / 35
» Structural Properties and Tractability Results for Linear Sy...
Sort
View
IJFCS
2006
70views more  IJFCS 2006»
13 years 6 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
MST
2007
154views more  MST 2007»
13 years 6 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 4 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 6 months ago
Linear Algebra in the vector space of intervals
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. For example, we define a notion of diagonalization of s...
Nicolas Goze
CP
2009
Springer
14 years 7 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche