10414 search results - page 150 / 2083 » An efficient algorithm for Co-segmentation |
145
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
206
click to vote
ISNN
2004
Springer
15 years 11 months ago
2004
Springer
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
181
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
150
click to vote
BIOCOMP
2006
15 years 7 months ago
2006
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...