642 search results - page 51 / 129 » Approximation Algorithms for Minimum K-Cut |
124
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
127
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
117
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
124
click to vote
JMM2
2007
15 years 3 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
123
click to vote
ICA
2004
Springer
15 years 8 months ago
2004
Springer
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...