4843 search results - page 585 / 969 » The Shortcut Problem - Complexity and Approximation |
146
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
144
click to vote
3DPVT
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift in...
143
click to vote
CGI
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract. A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adap...
190
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
129
click to vote
NOMS
2006
IEEE
15 years 10 months ago
2006
IEEE
— This work considers the problem of hosting multiple third-party Internet services in a cost-effective manner so as to maximize a provider’s business objective. For this purpo...