5138 search results - page 887 / 1028 » Low-Entropy Set Selection. |
175
click to vote
PR
2007
15 years 5 months ago
2007
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
155
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
151
click to vote
CACM
2008
15 years 5 months ago
2008
What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm pat...
164
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
224
click to vote
CN
2008
15 years 5 months ago
2008
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing f...