ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
CVPR
2011
IEEE
12 years 9 months ago
2011
IEEE
In the square jigsaw puzzle problem one is required to reconstruct the complete image from a set of non-overlapping, unordered, square puzzle parts. Here we propose a fully automa...
SIAMCO
2010
13 years 16 days ago
2010
Abstract. In the paper compressible, stationary Navier-Stokes (N-S) equations are considered. The model is well-posed, there exist weak solutions in bounded domains, subject to inh...
PVLDB
2010
13 years 17 days ago
2010
The ever-increasing number of intrusions in public and commercial networks has created the need for high-speed archival solutions that continuously store streaming network data to...
PPL
2010
13 years 17 days ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
MOC
2010
13 years 17 days ago
2010
It is widely believed that if monotone difference schemes are applied to the linear convection equation with discontinuous initial data, then solutions of the monotone schemes are ...
JMIV
2010
13 years 18 days ago
2010
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...
JAIR
2010
13 years 18 days ago
2010
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
TELSYS
2011
13 years 22 days ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...