369 search results - page 51 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
109
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
102
click to vote
ACL
2009
14 years 9 months ago
2009
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...
142
click to vote
SIROCCO
1997
15 years 1 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
EWSN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
120
Voted
SAT
2010
Springer
14 years 10 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...