4908 search results - page 665 / 982 » On the Complexity of Optimal K-Anonymity |
149
click to vote
IJCAI
2001
15 years 8 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
161
click to vote
IJCAI
2001
15 years 8 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
227
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
We are trying to piece together the knowledge of evolution with the help of biology, informatics and physics to create complex evolutionary algorithms with parallel and hierarchic...
198
click to vote
NIPS
2004
15 years 8 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
172
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...