Sciweavers

134 search results - page 16 / 27
» Measuring Large Overlay Networks - The Overnet Example
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
14 years 1 months ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
BIOCOMP
2006
13 years 9 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
IMC
2006
ACM
14 years 1 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
IJCNN
2008
IEEE
14 years 2 months ago
Support vector machines and dynamic time warping for time series
— Effective use of support vector machines (SVMs) in classification necessitates the appropriate choice of a kernel. Designing problem specific kernels involves the definition...
Steinn Gudmundsson, Thomas Philip Runarsson, Sven ...