350 search results - page 65 / 70 » Lower bounds and heuristic algorithms for the k |
ICLP
1997
Springer
14 years 17 days ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, frequency estimation of a twodimensional (2D) cisoid in the presence of additive white Gaussian noise is addressed. By utilizing the rank-one property of the 2D noi...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
GPEM
2008
13 years 8 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
MOR
2010
13 years 6 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...