1265 search results - page 76 / 253 » Finding the Key to a Synapse |
SSPR
1998
Springer
14 years 1 months ago
1998
Springer
In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
CIAC
1997
Springer
14 years 1 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
ESA
1994
Springer
14 years 1 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
SWAT
1994
Springer
14 years 1 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
SWAT
1994
Springer
14 years 1 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...