7015 search results - page 1283 / 1403 » Approximation algorithms for co-clustering |
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
MP
2007
13 years 8 months ago
2007
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
PR
2008
13 years 8 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
RSA
2008
13 years 8 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...