4843 search results - page 359 / 969 » The Shortcut Problem - Complexity and Approximation |
139
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
125
click to vote
ISBI
2004
IEEE
16 years 5 months ago
2004
IEEE
We provide approximate expressions for the covariance matrix of kinetic parameter estimators based on time activity curve (TAC) reconstructions when TACs are modeled as a linear c...
221
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
139
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
128
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...