549 search results - page 48 / 110 » On the Complexity of Restricted k-anonymity Problem |
103
click to vote
3DIM
1999
IEEE
15 years 2 months ago
1999
IEEE
Modeling of 3D objects from image sequences is a challenging problem and has been a research topic for many years. Important theoretical and algorithmic results were achieved that...
JC
2007
14 years 9 months ago
2007
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
PPAM
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
ICC
2000
IEEE
15 years 2 months ago
2000
IEEE
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
ESANN
2008
14 years 11 months ago
2008
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...