562 search results - page 92 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
APPROX
2006
Springer
14 years 7 days ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
CIKM
2006
Springer
14 years 6 days ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
MM
2010
ACM
13 years 8 months ago
2010
ACM
We provide an efficient technique of color and luminance compensation for sequences of overlapping images. It can be used in construction of high-resolution and high-quality panor...
ICALP
2011
Springer
12 years 12 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...