110 search results - page 8 / 22 » Greedy List Intersection |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
TIT
2008
13 years 9 months ago
2008
An underdetermined linear system of equations Ax = b with non-negativity constraint x 0 is considered. It is shown that for matrices A with a row-span intersecting the positive o...
WISE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
GMP
2000
IEEE
14 years 2 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...