554 search results - page 21 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
SIGMOD
2005
ACM
14 years 2 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
MP
2006
13 years 8 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
SRDS
1998
IEEE
14 years 1 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
SAC
2000
ACM
14 years 1 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
PAMI
2007
13 years 8 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....