4894 search results - page 596 / 979 » The Guarding Problem - Complexity and Approximation |
141
click to vote
3DPVT
2006
IEEE
15 years 10 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...
140
click to vote
CGI
2006
IEEE
15 years 10 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...
185
click to vote
ICDM
2006
IEEE
15 years 10 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...
125
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...
137
click to vote
P2P
2006
IEEE
15 years 10 months ago
2006
IEEE
Recently there has been an increasing interest to harness the potential of P2P technology to design and build rich environments where services are provided and multiple applicatio...