Sciweavers

2520 search results - page 189 / 504
» The complexity of approximating entropy
Sort
View
PODC
2009
ACM
15 years 11 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
15 years 5 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
14 years 11 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
TCOM
2010
65views more  TCOM 2010»
14 years 5 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
COMPGEOM
2004
ACM
15 years 4 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount