Sciweavers

4908 search results - page 11 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
WINET
2011
14 years 6 months ago
High performance, low complexity cooperative caching for wireless sensor networks
During the last decade, Wireless Sensor Networks (WSNs) have emerged and matured at such point that currently support several applications like environment control, intelligent bu...
Nikos Dimokas, Dimitrios Katsaros, Leandros Tassiu...
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
14 years 6 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
EC
2008
153views ECommerce» more  EC 2008»
14 years 11 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
PODC
2012
ACM
13 years 2 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 9 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac