Sciweavers

530 search results - page 93 / 106
» Bounds on marginal probability distributions
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer
FOCM
2006
97views more  FOCM 2006»
13 years 8 months ago
Learning Rates of Least-Square Regularized Regression
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
MOR
2007
149views more  MOR 2007»
13 years 7 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
ICNP
2009
IEEE
13 years 5 months ago
RASPberry: A Stable Reader Activation Scheduling Protocol in Multi-Reader RFID Systems
Abstract--Recent technological advances have motivated largescale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the...
ShaoJie Tang, Jing Yuan, Xiang-Yang Li, Guihai Che...