Sciweavers

5595 search results - page 470 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ISCI
2002
118views more  ISCI 2002»
15 years 7 months ago
Hyper-rectangle based segmentation and clustering of large video data sets
Video information processing has been one of great challenging areas in the database community since it needs huge amount of storage space and processing power. In this paper, we ...
Seok-Lyong Lee, Chin-Wan Chung
IMCSIT
2010
15 years 2 months ago
Multi-level Parallelization with Parallel Computational Services in BeesyCluster
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...
Pawel Czarnul
FOCS
2007
IEEE
16 years 1 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
FOCS
2000
IEEE
16 years 13 hour ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 8 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra