Sciweavers

474 search results - page 49 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
COMPGEOM
2006
ACM
14 years 1 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
ICPP
2002
IEEE
14 years 27 days ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
14 years 2 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
ICIP
2004
IEEE
14 years 9 months ago
Detection of unique people in news programs using multimodal shot clustering
In this paper we describe an approach that uses a combination of visual and audio features to cluster shots belonging to the same person together in video programs. We use color h...
Alberto Albiol, Cüneyt M. Taskiran, Edward J....