306 search results - page 24 / 62 » On the Minimal Uncompletable Word Problem |
112
click to vote
SIAMDM
2011
14 years 8 months ago
2011
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
114
click to vote
SIAMMAX
2010
14 years 8 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
148
click to vote
ICASSP
2011
IEEE
14 years 5 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...
124
click to vote
DKE
1999
15 years 1 months ago
1999
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
141
click to vote
SIAMJO
2010
14 years 8 months ago
2010
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...