1695 search results - page 229 / 339 » Linear, Polynomial or Exponential |
112
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
136
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
140
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
140
click to vote
IMA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
125
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...