3049 search results - page 86 / 610 » On the Convergence of Bound Optimization Algorithms |
151
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
While using more biometric traits in multimodal biometric fusion can effectively increase the system robustness, often, the cost associated to adding additional systems is not con...
166
click to vote
DC
2010
15 years 4 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
137
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
110
click to vote
SPDP
1991
IEEE
15 years 8 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
130
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...