Sciweavers

9176 search results - page 330 / 1836
» algorithms 2010
Sort
View
TCOM
2010
65views more  TCOM 2010»
15 years 1 months ago
Evaluation of the distance spectrum of variable-length finite-state codes
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...
Claudio Weidmann, Michel Kieffer
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 4 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
ATAL
2010
Springer
15 years 7 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
WWW
2010
ACM
16 years 1 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 6 months ago
On Metric Clustering to Minimize the Sum of Radii
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...