198 search results - page 1 / 40 » On Extremal Cases of Hopcroft's Algorithm |
WIA
2009
Springer
13 years 9 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
CP
2004
Springer
13 years 10 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
VISUALIZATION
1998
IEEE
13 years 9 months ago
1998
IEEE
We are interested in feature extraction from volume data in terms of coherent surfaces and 3-D space curves. The input can be an inaccurate scalar or vector field, sampled densely...