112 search results - page 14 / 23 » Approximate methods for convex minimization problems with se... |
TIT
2008
13 years 7 months ago
2008
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ISPD
1997
ACM
13 years 11 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
WCNC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—In this paper, we consider a robust design of MIMOrelay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO...