1414 search results - page 29 / 283 » Cover Time and Broadcast Time |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
CCCG
2007
13 years 11 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
COMGEO
2008
ACM
13 years 10 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many comm...