554 search results - page 68 / 111 » Approximation algorithms and hardness results for labeled co... |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
IJCAI
2007
13 years 9 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...