Sciweavers

20294 search results - page 403 / 4059
» Algorithmic Information Theory
Sort
View
ICASSP
2011
IEEE
14 years 11 months ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro
IPMI
2009
Springer
16 years 8 months ago
Estimation of Inferential Uncertainty in Assessing Expert Segmentation Performance from STAPLE
The evaluation of the quality of segmentations of an image, and the assessment of intra- and inter-expert variability in segmentation performance, has long been recognized as a dic...
Olivier Commowick, Simon K. Warfield
SPAA
2005
ACM
16 years 1 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 1 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
ISCAPDCS
2001
15 years 9 months ago
Bandwidth Learning in Distributed Networking Environments for Global Information Dissemination
- This work investigates bandwidth learning algorithms in a version of a distributed heterogeneous data dissemination system called the Agile Information Control Environment (AICE)...
Craig Sullivan, Michael Jurczyk