Sciweavers

2520 search results - page 286 / 504
» The complexity of approximating entropy
Sort
View
IROS
2007
IEEE
135views Robotics» more  IROS 2007»
16 years 27 days ago
Power-SLAM: A linear-complexity, consistent algorithm for SLAM
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
Esha D. Nerurkar, Stergios I. Roumeliotis
PG
2007
IEEE
16 years 26 days ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
VTC
2007
IEEE
104views Communications» more  VTC 2007»
16 years 26 days ago
Subspace Tracking Based Blind MIMO Transmit Preprocessing
Abstract— In this contribution projection approximation subspace tracking using deflation (PASTD) is investigated in the context of MIMO transmit preprocessing systems by exploi...
Wei Liu, Lie-Liang Yang, Lajos Hanzo
COLT
2007
Springer
16 years 23 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
EPEW
2007
Springer
16 years 23 days ago
Towards an Automatic Modeling Tool for Observed System Behavior
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of capa...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...