Sciweavers

485 search results - page 35 / 97
» Weighted Factorization
Sort
View
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
14 years 10 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
SIGIR
2005
ACM
15 years 4 months ago
Iterative translation disambiguation for cross-language information retrieval
Finding a proper distribution of translation probabilities is one of the most important factors impacting the effectiveness of a crosslanguage information retrieval system. In th...
Christof Monz, Bonnie J. Dorr
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 2 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
TSP
2010
14 years 5 months ago
An efficient approach for two-dimensional parameter estimation of a single-tone
Abstract--In this paper, parameter estimation of a two-dimensional (2-D) single damped real/complex tone in the presence of additive white Gaussian noise is addressed. By utilizing...
H. C. So, Frankie K. W. Chan, W. H. Lau, Cheung-Fa...
PODC
2005
ACM
15 years 4 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...