3422 search results - page 138 / 685 » Random Subset Optimization |
157
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
In many classification tasks training data have missing feature values that can be acquired at a cost. For building accurate predictive models, acquiring all missing values is of...
139
click to vote
ACMSE
2005
ACM
15 years 10 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
142
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
144
click to vote
MLQ
2007
15 years 4 months ago
2007
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
140
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...