12519 search results - page 325 / 2504 » Approximation Problems Categories |
163
click to vote
IJSNET
2008
15 years 6 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
165
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
184
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
172
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation ...
145
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...