1523 search results - page 196 / 305 » The Computational Complexity of Linear Optics |
117
click to vote
DSD
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
132
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In the context of digital pre-distortion, a typical requirement is to identify the power amplifier with stringently low computational complexity. Accordingly, we consider a simpl...
125
Voted
AUTOMATICA
2010
15 years 4 months ago
2010
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-over...
135
click to vote
IJISEC
2006
15 years 3 months ago
2006
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
134
Voted
JIIS
2006
15 years 3 months ago
2006
Kernel Canonical Correlation Analysis (KCCA) is a method of correlating linear relationship between two variables in a kernel defined feature space. A machine learning algorithm b...