9842 search results - page 1393 / 1969 » The Complexity of the Matching-Cut Problem |
166
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
216
click to vote
PODS
2000
ACM
15 years 11 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
181
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, ...
191
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
187
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...