725 search results - page 120 / 145 » A General Greedy Approximation Algorithm with Applications |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
80
Voted
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Typical applications of evolutionary optimization in static environments involve the approximation of the extrema of functions. For dynamic environments, the interest is not to lo...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...