Sciweavers

316 search results - page 11 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
SIGECOM
2003
ACM
92views ECommerce» more  SIGECOM 2003»
14 years 21 days ago
Strategyproof cost-sharing mechanisms for set cover and facility location games
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
Nikhil R. Devanur, Milena Mihail, Vijay V. Vaziran...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
PVLDB
2008
174views more  PVLDB 2008»
13 years 7 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
NIPS
2004
13 years 8 months ago
Incremental Algorithms for Hierarchical Classification
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
Nicolò Cesa-Bianchi, Claudio Gentile, Andre...
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 11 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao