10414 search results - page 342 / 2083 » An efficient algorithm for Co-segmentation |
166
click to vote
SIROCCO
2004
15 years 8 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
156
click to vote
AAAI
1996
15 years 8 months ago
1996
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
203
click to vote
TMC
2008
15 years 6 months ago
2008
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
179
click to vote
TKDE
2002
15 years 6 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
172
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...