10414 search results - page 378 / 2083 » An efficient algorithm for Co-segmentation |
170
click to vote
SRDS
1998
IEEE
15 years 11 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
176
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
157
click to vote
CCCG
2008
15 years 8 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
171
click to vote
CCCG
2008
15 years 8 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
162
click to vote
CSDA
2006
15 years 6 months ago
2006
: In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation usi...