Sciweavers

14642 search results - page 2859 / 2929
» It's Time for a Change
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 1 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ATAL
2010
Springer
15 years 1 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
CEC
2010
IEEE
15 years 1 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
15 years 1 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 1 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
« Prev « First page 2859 / 2929 Last » Next »