2485 search results - page 447 / 497 » Time Bounded Frequency Computations |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
QUESTA
2010
13 years 6 months ago
2010
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...