75 search results - page 12 / 15 » On the Complexity of Hopcroft's State Minimization Algorithm |
ISCA
2005
IEEE
14 years 2 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
ICDCSW
2007
IEEE
14 years 2 months ago
2007
IEEE
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
NIPS
2007
13 years 10 months ago
2007
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...