Sciweavers

1823 search results - page 187 / 365
» Distributed lossy averaging
Sort
View
ASMTA
2011
Springer
295views Mathematics» more  ASMTA 2011»
14 years 10 months ago
Performance Evaluation of a Single Node with General Arrivals and Service
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
Alexandre Brandwajn, Thomas Begin
ASPDAC
2011
ACM
217views Hardware» more  ASPDAC 2011»
14 years 10 months ago
Realization and performance comparison of sequential and weak memory consistency models in network-on-chip based multi-core syst
This paper studies realization and performance comparison of the sequential and weak consistency models in the network-on-chip (NoC) based distributed shared memory (DSM) multi-cor...
Abdul Naeem, Xiaowen Chen, Zhonghai Lu, Axel Jants...
IPL
2011
91views more  IPL 2011»
14 years 9 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
GANDC
2011
93views more  GANDC 2011»
14 years 6 months ago
Bayesian spatial modeling and interpolation using copulas
Copulas have attracted much attention in spatial statistics over the past few years. They are used as a flexible alternative to traditional methods for nonGaussian spatial modelin...
Hannes Kazianka, Jürgen Pilz
CORR
2012
Springer
228views Education» more  CORR 2012»
14 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled