1998 search results - page 30 / 400 » Complexity of the Cover Polynomial |
WIA
2004
Springer
14 years 3 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
MST
2007
13 years 9 months ago
2007
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...
COLT
1995
Springer
14 years 1 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
TCS
2008
13 years 9 months ago
2008
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
MST
2010
13 years 8 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...