Sciweavers

96 search results - page 12 / 20
» A Kalman-like algorithm with no requirements for noise and i...
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 7 months ago
Slow Adaptive OFDMA Systems Through Chance Constrained Programming
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
William Weiliang Li, Ying Jun Zhang, Anthony Man-C...
CSCLP
2006
Springer
13 years 11 months ago
Distributed Forward Checking May Lie for Privacy
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
Ismel Brito, Pedro Meseguer
IJAR
2007
55views more  IJAR 2007»
13 years 7 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel

Publication
184views
15 years 5 months ago
Design and Evaluation of Feedback Consolidation for ABR Point-to-Multipoint Connections in ATM Networks
The available bit rate (ABR) service is proposed to transport data traffic in asynchronous transfer mode (ATM) networks. ABR is unique because the network switches can indicate to ...
Sonia Fahmy, Raj Jain, Rohit Goyal, Bobby Vandalor...
PAMI
2006
230views more  PAMI 2006»
13 years 7 months ago
Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas