2254 search results - page 94 / 451 » Computing the minimal covering set |
94
Voted
DATE
2002
IEEE
15 years 5 months ago
2002
IEEE
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
127
click to vote
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
80
Voted
COCO
1998
Springer
15 years 5 months ago
1998
Springer
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
119
click to vote
AIPR
2006
IEEE
15 years 6 months ago
2006
IEEE
Remotely sensed images from satellite sensors such as MODIS Aqua and Terra provide high temporal resolution and wide area coverage. Unfortunately, these images frequently include ...
90
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...