Sciweavers

3055 search results - page 471 / 611
» Randomized Search Trees
Sort
View
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 11 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
IJNSEC
2010
128views more  IJNSEC 2010»
14 years 11 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
IACR
2011
116views more  IACR 2011»
14 years 4 months ago
Some Words About Cryptographic Key Recognition In Data Streams
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...
Alexey Chilikov, Evgeny Alekseev
ICML
2008
IEEE
16 years 5 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
16 years 1 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri