Sciweavers

2957 search results - page 375 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
INFOCOM
2007
IEEE
16 years 25 days ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
IROS
2007
IEEE
135views Robotics» more  IROS 2007»
16 years 25 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 24 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 24 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