3875 search results - page 435 / 775 » Approximation algorithms for the 0-extension problem |
223
Voted
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
154
click to vote
EUROPAR
2007
Springer
16 years 28 days ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
258
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
178
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...