6365 search results - page 952 / 1273 » Fast Local Computation Algorithms |
160
click to vote
CGF
2006
15 years 6 months ago
2006
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
191
click to vote
FGCS
2006
15 years 6 months ago
2006
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
167
click to vote
JCIT
2010
15 years 1 months ago
2010
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...
165
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
216
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...