Sciweavers

447 search results - page 70 / 90
» Approximation Algorithms for Directed Steiner Problems
Sort
View
INFOCOM
2010
IEEE
14 years 11 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
IPPS
2005
IEEE
15 years 7 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
14 years 1 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
HEURISTICS
2008
120views more  HEURISTICS 2008»
15 years 1 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 1 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...