11381 search results - page 49 / 2277 » Connectivity |
IJCNN
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper deals with the more recent results obtained by the application of the CSLU Toolkit frame-based hybrid HMM/ANN architecture on the connected digit recognition task for t...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
FMCAD
2000
Springer
15 years 1 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
CCCG
2010
14 years 11 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.