Sciweavers

303 search results - page 26 / 61
» Computing Minimal Spanning Subgraphs in Linear Time
Sort
View
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 8 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 6 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
COLT
1997
Springer
14 years 27 days ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
PR
2007
100views more  PR 2007»
13 years 8 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
TWC
2008
177views more  TWC 2008»
13 years 8 months ago
Generalized Design of Multi-User MIMO Precoding Matrices
In this paper we introduce a novel linear precoding technique. The approach used for the design of the precoding matrix is general and the resulting algorithm can address several o...
Veljko Stankovic, Martin Haardt