2292 search results - page 42 / 459 » Hierarchical approximation and localization |
236
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
167
click to vote
ANSS
2008
IEEE
15 years 10 months ago
2008
IEEE
Efficient job scheduling in grids is challenging due to the large number of distributed autonomous resources. In this paper we study various resource allocation policies in a 2-le...
166
click to vote
AAAI
2000
15 years 5 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
140
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...