Zobrazeno 1 - 10
of 156
pro vyhledávání: '"Oppenheim, A. V."'
Autor:
Ding, Qi, Oppenheim, Alan V., Boufounos, Petros T., Gustavsson, Simon, Grover, Jeffrey A., Baran, Thomas A., Oliver, William D.
Despite progress towards achieving low error rates with superconducting qubits, error-prone two-qubit gates remain a bottleneck for realizing large-scale quantum computers. Therefore, a systematic framework to design high-fidelity gates becomes imper
Externí odkaz:
http://arxiv.org/abs/2407.02722
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The theoretical basis for conventional acquisition of bandlimited signals typically relies on uniform time sampling and assumes infinite-precision amplitude values. In this paper, we explore signal representation and recovery based on uniform amplitu
Externí odkaz:
http://arxiv.org/abs/1802.04672
Analog-to-digital (A/D) converters are the common interface between analog signals and the domain of digital discrete-time signal processing. In essence, this domain simultaneously incorporates quantization both in amplitude and time, i.e. amplitude
Externí odkaz:
http://arxiv.org/abs/1802.04634
Autor:
Demirtas, Sefa, Oppenheim, Alan V.
Designing and implementing systems as an interconnection of smaller subsystems is a common practice for modularity and standardization of components and design algorithms. Although not typically cast in this framework, many of these approaches can be
Externí odkaz:
http://arxiv.org/abs/1511.00379
Autor:
Lahlou, Tarek A., Oppenheim, Alan V.
This paper presents two novel regularization methods motivated in part by the geometric significance of biorthogonal bases in signal processing applications. These methods, in particular, draw upon the structural relevance of orthogonality and biorth
Externí odkaz:
http://arxiv.org/abs/1509.05895
Autor:
Lahlou, Tarek A., Oppenheim, Alan V.
This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology. Fo
Externí odkaz:
http://arxiv.org/abs/1502.01220
Autor:
Varshney, Lav R., Agarwal, Shivali, Chee, Yi-Min, Sindhgatta, Renuka R., Oppenheim, Daniel V., Lee, Juhnyoung, Ratakonda, Krishna
Formal coordination mechanisms are of growing importance as human-based service delivery becomes more globalized and informal mechanisms are no longer effective. Further it is becoming apparent that business environments, communication among distribu
Externí odkaz:
http://arxiv.org/abs/1406.0215
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Signal Processing 2004 84(4):677-693
