4908 search results - page 59 / 982 » On the Complexity of Optimal K-Anonymity |
166
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
144
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Modular structure is ubiquitous in real-world complex networks. The detection of this type of organization into modules gives insights in the relationship between topological stru...
194
click to vote
INFOCOM
2007
IEEE
16 years 13 days ago
2007
IEEE
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
166
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...