4908 search results - page 759 / 982 » On the Complexity of Optimal K-Anonymity |
182
click to vote
EUROPAR
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
177
click to vote
EVOW
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
147
click to vote
FIMH
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Long term responses of the heart to e.g. infarction or surgical intervention are related to response of the tissue to changes in the mechanical environment. The tissue re...
181
click to vote
FSTTCS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
153
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
We present what we believe is the first attempt to physically reconstruct the exploratory mechanism of genetic regulatory networks. Feedback plays a crucial role during developme...