Sciweavers

2520 search results - page 228 / 504
» The complexity of approximating entropy
Sort
View
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
16 years 1 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
GLOBECOM
2006
IEEE
16 years 1 months ago
An Iterative MIMO-HSDPA Receiver Based On a K-Best-MAP Algorithm
— We propose an iterative receiver for horizontally encoded MIMO systems like the PARC proposal for MIMOHSDPA. Our receiver uses a K-best-MAP demodulator to provide the channel d...
Christian Mehlführer, Dominik Seethaler, Gera...
IROS
2006
IEEE
135views Robotics» more  IROS 2006»
16 years 1 months ago
Toward Legless Locomotion Control
— Motivated by an error-recovery locomotion problem, we propose a control technique for a complex mechanical system by decomposing the system dynamics into a collection of simpli...
Ravi Balasubramanian, Alfred A. Rizzi, Matthew T. ...
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
16 years 23 days ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
ICALP
2005
Springer
16 years 22 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen