1026 search results - page 2 / 206 » On Finding Minimal w-cutset |
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
DCG
2000
13 years 7 months ago
2000
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
ISVLSI
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...