283 search results - page 31 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...