4908 search results - page 124 / 982 » On the Complexity of Optimal K-Anonymity |
178
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
161
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
205
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
200
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
185
click to vote
PROMISE
2010
15 years 1 months ago
2010
Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solution...