2107 search results - page 68 / 422 » Computing Small Search Numbers in Linear Time |
156
click to vote
COCO
2011
Springer
14 years 3 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
109
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
125
click to vote
ICA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
115
click to vote
INFORMS
2000
15 years 3 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
118
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...