192 search results - page 21 / 39 » Optimal Combination of Sampled Network Measurements |
ANTSW
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
VLDB
2004
ACM
14 years 2 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
DAGM
2011
Springer
12 years 6 months ago
2011
Springer
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Results of neural network learning are always subject to some variability, due to the sensitivity to initial conditions, to convergence to local minima, and, sometimes more dramat...
RECOMB
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...