2925 search results - page 524 / 585 » Information Complexity of Online Problems |
150
Voted
KES
1999
Springer
15 years 7 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
144
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
145
Voted
IMC
2007
ACM
15 years 5 months ago
2007
ACM
We address the problem of efficient end-to-end network monitoring of path metrics in communication networks. Our goal is to minimize the number of measurements or monitors requir...
159
Voted
DFN
2003
15 years 4 months ago
2003
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
154
Voted
IDA
2000
Springer
15 years 3 months ago
2000
Springer
When high-dimensional data vectors are visualized on a two- or three-dimensional display, the goal is that two vectors close to each other in the multi-dimensional space should als...