4908 search results - page 633 / 982 » On the Complexity of Optimal K-Anonymity |
183
click to vote
SMA
2006
ACM
16 years 24 days ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
180
click to vote
DATE
2005
IEEE
16 years 14 days ago
2005
IEEE
With the advent of multi-processor systems on a chip, the interest for message passing libraries has revived. Message passing helps in mastering the design complexity of parallel ...
158
Voted
ICIP
2005
IEEE
16 years 13 days ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
156
click to vote
ICMCS
2005
IEEE
16 years 13 days ago
2005
IEEE
A video Cut Detector (CD), a member of the Shot Boundary Detector (SBD) group, is an essential element for spatio-temporal audiovisual (AV) segmentation and various video-processi...
163
click to vote
ICTAI
2005
IEEE
16 years 13 days ago
2005
IEEE
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...