4908 search results - page 725 / 982 » On the Complexity of Optimal K-Anonymity |
163
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Power consumption, particularly runtime leakage, in long on-chip buses has grown to an unacceptable portion of the total power budget due to heavy buffer insertion to combat RC de...
232
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
185
click to vote
MICCAI
2006
Springer
16 years 7 months ago
2006
Springer
3D ultrasound (US) is an emerging new imaging technology that appeals to more and more applications in intraoperative guidance of computer-assisted surgery. In a freehand US imagin...
153
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
201
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...