1933 search results - page 128 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
142
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
120
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
197
click to vote
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
118
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
112
Voted
CIKM
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of organizing and browsing the top ranked portion of the documents returned by an information retrieval system. We study the effectiveness of a document o...