7930 search results - page 49 / 1586 » Greedy in Approximation Algorithms |
111
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
106
click to vote
DKE
2008
15 years 2 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
132
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
130
Voted
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
115
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...