Sciweavers

1347 search results - page 30 / 270
» On the Structure of the Minimum Time Function
Sort
View
DAC
1994
ACM
13 years 11 months ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
CSDA
2007
102views more  CSDA 2007»
13 years 7 months ago
Smooth functions and local extreme values
Given a sample of n observations y1, . . . , yn at time points t1, . . . , tn we consider the problem of specifying a function ˜f such that ˜f • is smooth, • fits the data ...
A. Kovac
WSS
2001
133views Control Systems» more  WSS 2001»
13 years 9 months ago
A Composite Stabilizing Data Structure
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
Ted Herman, Imran A. Pirwani
CISS
2007
IEEE
14 years 2 months ago
Precoder Optimization for Nonlinear MIMO Transceiver Based on Arbitrary Cost Function
— Assuming full channel state information (CSI) at both transmitter (CSIT) and receiver (CSIR), we consider optimizing a nonlinear MIMO transceiver with (nonlinear) decision feed...
Yi Jiang, Daniel Pérez Palomar, Mahesh K. V...
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
14 years 15 days ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...