2069 search results - page 35 / 414 » Linear time algorithms for Clobber |
145
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
155
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
118
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Online boosting methods have recently been used successfully for tracking, background subtraction etc. Conventional online boosting algorithms emphasize on interchanging new weak ...
131
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
135
Voted
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...