4908 search results - page 315 / 982 » On the Complexity of Optimal K-Anonymity |
177
click to vote
AVSS
2006
IEEE
16 years 24 days ago
2006
IEEE
This paper presents a novel method for illuminationinvariant and contrast preserving feature extraction, aimed at improving performance of tracking under complex light condition. ...
189
click to vote
EOR
2008
15 years 6 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
240
click to vote
TSMC
2008
15 years 6 months ago
2008
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
279
click to vote
CF
2011
ACM
14 years 6 months ago
2011
ACM
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...
191
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...