774 search results - page 78 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
PR
2006
13 years 9 months ago
2006
Fuzzy-clustering methods, such as fuzzy k-means and Expectation Maximization, allow an object to be assigned to multiple clusters with different degrees of membership. However, th...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
GCC
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
PPSN
1992
Springer
14 years 1 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...