Sciweavers

2520 search results - page 253 / 504
» The complexity of approximating entropy
Sort
View
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 5 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
15 years 1 months ago
Event-triggered output feedback control of finite horizon discrete-time multi-dimensional linear processes
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
Lichun Li, Michael Lemmon
ICASSP
2011
IEEE
14 years 10 months ago
ML decoding in decode-and-forward based cooperative communication system
Abstract— In this paper, we derive a maximum-likelihood (ML) decoder of the decode-and-forward (DF) protocol utilizing an arbitrary complex-valued M-point constellation. Existing...
Manav R. Bhatnagar, Are Hjørungnes
ICASSP
2011
IEEE
14 years 10 months ago
Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...
Xuan-Thang Vu, Marco Di Renzo, Pierre Duhamel
ML
2012
ACM
413views Machine Learning» more  ML 2012»
14 years 2 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...