Sciweavers

536 search results - page 59 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 6 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 8 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
GLOBECOM
2007
IEEE
14 years 2 months ago
Low Complexity Soft-Input Soft-Output Block Decision Feedback Equalization
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
Jingxian Wu, Yahong Rosa Zheng
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 1 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke