7930 search results - page 65 / 1586 » Greedy in Approximation Algorithms |
133
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
104
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
104
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
114
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper, an information theoretic framework for image segmentation is presented. This approach is based on the information channel that goes from the image intensity histogr...
126
Voted
SIGMETRICS
2002
ACM
15 years 2 months ago
2002
ACM
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...