4908 search results - page 180 / 982 » On the Complexity of Optimal K-Anonymity |
154
click to vote
WSC
2007
15 years 8 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
151
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
In many regression learning algorithms for fuzzy rule bases it is not possible to define the error measure to be optimized freely. A possible alternative is the usage of global o...
174
click to vote
DC
2007
15 years 6 months ago
2007
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...
185
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
A main advantage of control composition with modal processes [4] is the enhanced retargetability of the composed behavior over a wide variety of target architectures. Unlike previ...
149
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...