• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 50
Next 10 →

USENIX Association 11th USENIX Conference on File and Storage Technologies (FAST ’13) 215 Getting Real: Lessons in Transitioning Research Simulations into Hardware Systems

by Mohit Saxena, Yiying Zhang, Michael M. Swift, Andrea C. Arpaci-dusseau, Remzi H. Arpaci-dusseau
"... Flash-based solid-state drives have revolutionized stor-age with their high performance. Their sophisticated in-ternal mechanisms have led to a plethora of research on how to optimize applications, file systems, and internal SSD designs. Due to the closed nature of commercial de-vices though, most r ..."
Abstract - Add to MetaCart
Flash-based solid-state drives have revolutionized stor-age with their high performance. Their sophisticated in-ternal mechanisms have led to a plethora of research on how to optimize applications, file systems, and internal SSD designs. Due to the closed nature of commercial de-vices though, most

AGR 05

by Università Degli, Studi Della Tuscia, Dottorato Di Ricerca, Candidato Tutori, Alessandra Lagomarsino, Prof Paolo, De Angelis, Prof Stefano Grego, Prof Paolo, De Angelis
"... Responses of soil biological processes to elevated atmospheric [CO2] and nitrogen addition in a poplar plantation ..."
Abstract - Add to MetaCart
Responses of soil biological processes to elevated atmospheric [CO2] and nitrogen addition in a poplar plantation

Minimum Variance Estimation of a Sparse Vector Within the Linear Gaussian Model: An

by Zvika Ben-haim, Yonina C. Eldar
"... Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterizat ..."
Abstract - Add to MetaCart
subspace of the RKHS associated with the SLGM. It provides an approximation to the minimum achievable variance (Barankin bound) that is tighter than any known bound. Our bound holds for an arbitrary system matrix, including the overdetermined and underdetermined cases. We specialize

Supervised by

by Aleksandar Velikov, Prof Dr. Johannes Buchmann, Richard Lindner Acknowledgements , 2007
"... I would like to thank my parents for always believing in me. I would also like to thank my supervisors Richard Lindner and Johannes Buchmann for their useful comments and suggestions on how to improve the queality of the thesis. Not on last place I would like to thank Vadim Lyubashevsky and Luis Car ..."
Abstract - Add to MetaCart
I would like to thank my parents for always believing in me. I would also like to thank my supervisors Richard Lindner and Johannes Buchmann for their useful comments and suggestions on how to improve the queality of the thesis. Not on last place I would like to thank Vadim Lyubashevsky and Luis Carlos Coronado Garcia for their kindness and readiness to answer my questions. Warranty I hereby warrant that the content of this thesis is the direct result of my own work and that any use made in it of published or unpublished material is fully and correctly referenced. I also warrant that the presented work has

TO CODE OR NOT TO CODE

by Présentée À La, Faculté Informatique, Et Communications, Section Des, Systèmes De Communication, Du Grade, De Docteur, Ès Sciences, Prof M. Vetterli, Prof B. Rimoldi, Prof R. Gallager, Prof A. Lapidoth, Prof J. Massey, Prof E. Telatar, Prof S. Verdú, Michael Gastpar, Amos Lapidoth, Jim Ma , 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract - Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:

DOCTEUR EN SCIENCES

by Bhaskar Biswas, Bhaskar Biswas , 2010
"... Implementational aspects of code-based cryptography ..."
Abstract - Add to MetaCart
Implementational aspects of code-based cryptography

1 Minimum Variance Estimation of a Sparse Vector within the Linear Gaussian Model:

by Alexander Junga (corresponding, Zvika Ben-haimc, Yonina C. Eldard
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

4. TITLE AND SUBTITLE A Practical Theory of Micro-Solar Power Sensor Networks

by Jaein Jeong , 2009
"... Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract - Add to MetaCart
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information,

Using BubbleStorm Accepted Master-Thesis from Marcel Lucas

by Assessor Prof Alej, Ro P. Buchmann, Ph. D
"... Hiermit versichere ich, die vorliegende Master-Thesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehö ..."
Abstract - Add to MetaCart
of scalability and maintainability. Hence, different approaches are based on Peer-to-Peer (P2P) technology. In particular, fast-paced NVEs stress these systems and most likely cause high overlay maintenance overhead. This Master’s Thesis presents a novel approach to spatial Publish/Subscribe (Pub/Sub) in P2P

RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

by Jason Noah Laska , 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract - Add to MetaCart
of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sam-pling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs
Next 10 →
Results 1 - 10 of 50
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University