4908 search results - page 100 / 982 » On the Complexity of Optimal K-Anonymity |
175
click to vote
FPGA
1998
ACM
15 years 10 months ago
1998
ACM
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
206
click to vote
CVPR
2005
IEEE
15 years 8 months ago
2005
IEEE
The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such ...
180
click to vote
WSCG
2004
15 years 7 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
158
click to vote
JCSS
2006
15 years 6 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
169
click to vote
TIP
2008
15 years 6 months ago
2008
Our aim in this paper is to tighten the link between wavelets, some classical image-processing operators, and David Marr's theory of early vision. The cornerstone of our appro...