default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVida Ravanmehr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Vida Ravanmehr:
Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes. University of Arizona, Tucson, USA, 2015
Journal Articles
- 2023
- [j10]Luca Cappelletti
, Tommaso Fontana, Elena Casiraghi, Vida Ravanmehr, Tiffany J. Callahan, Carlos Cano, Marcin P. Joachimiak, Christopher J. Mungall, Peter N. Robinson, Justin T. Reese, Giorgio Valentini:
GRAPE for fast and scalable graph processing and random-walk-based embedding. Nat. Comput. Sci. 3(6): 552-568 (2023) - 2021
- [j9]Justin T. Reese, Deepak R. Unni, Tiffany J. Callahan, Luca Cappelletti, Vida Ravanmehr, Seth Carbon, Kent A. Shefchek, Benjamin M. Good, James P. Balhoff, Tommaso Fontana, Hannah Blau, Nicolas Matentzoglu, Nomi L. Harris, Monica C. Munoz-Torres, Melissa A. Haendel, Peter N. Robinson, Marcin P. Joachimiak, Christopher J. Mungall:
KG-COVID-19: A Framework to Produce Customized Knowledge Graphs for COVID-19 Response. Patterns 2(1): 100155 (2021) - 2020
- [j8]Kent A. Shefchek, Nomi L. Harris, Michael A. Gargano, Nicolas Matentzoglu, Deepak R. Unni, Matthew H. Brush, Dan Keith, Tom Conlin, Nicole A. Vasilevsky, Xingmin Aaron Zhang, James P. Balhoff, Larry Babb, Susan M. Bello, Hannah Blau, Yvonne M. Bradford, Seth Carbon, Leigh Carmody, Lauren E. Chan, Valentina Cipriani, Alayne Cuzick, Maria G. Della Rocca, Nathan A. Dunn, Shahim Essaid, Petra Fey, Christian A. Grove, Jean-Philippe F. Gourdine, Ada Hamosh, Midori A. Harris, Ingo Helbig, Maureen E. Hoatlin, Marcin P. Joachimiak, Simon Jupp, Kenneth B. Lett, Suzanna E. Lewis, Craig McNamara, Zoë May Pendlington, Clare Pilgrim, Tim E. Putman, Vida Ravanmehr, Justin T. Reese, Erin Rooney Riggs, Sofia M. C. Robb, Paola Roncaglia, James Seager, Erik Segerdell, Morgan Similuk, Andrea L. Storm, Courtney Thaxon, Anne E. Thessen, Julius O. B. Jacobsen, Julie A. McMurry, Tudor Groza, Sebastian Köhler, Damian Smedley, Peter N. Robinson, Christopher J. Mungall, Melissa A. Haendel, Monica C. Munoz-Torres, David Osumi-Sutherland:
The Monarch Initiative in 2019: an integrative data and analytic platform connecting phenotypes to genotypes across species. Nucleic Acids Res. 48(Database-Issue): D704-D715 (2020) - 2019
- [j7]Xingmin Aaron Zhang, Amy Yates, Nicole A. Vasilevsky, Jean-Philippe F. Gourdine, Tiffany J. Callahan, Leigh C. Carmody, Daniel Danis, Marcin P. Joachimiak, Vida Ravanmehr, Emily R. Pfaff, James Champion, Kimberly Robasky, Hao Xu, Karamarie Fecho, Nephi A. Walton, Richard L. Zhu, Justin Ramsdill, Christopher J. Mungall, Sebastian Köhler, Melissa A. Haendel, Clement J. McDonald, Daniel J. Vreeman, David B. Peden, Tellen D. Bennett, James A. Feinstein, Blake Martin, Adrianne L. Stefanski, Lawrence E. Hunter, Christopher G. Chute, Peter N. Robinson:
Semantic integration of clinical laboratory tests from electronic health records for deep phenotyping and biomarker discovery. npj Digit. Medicine 2 (2019) - 2018
- [j6]Vida Ravanmehr, Minji Kim, Zhiying Wang, Olgica Milenkovic:
ChIPWig: a random access-enabling lossless and lossy compression method for ChIP-seq data. Bioinform. 34(6): 911-919 (2018) - [j5]Vida Ravanmehr, Gregory J. Puleo, Sadegh Bolouki, Olgica Milenkovic:
Paired threshold graphs. Discret. Appl. Math. 250: 291-308 (2018) - 2016
- [j4]Vida Ravanmehr, Mehrdad Khatami, David Declercq, Bane Vasic:
Check-hybrid GLDPC codes: Systematic elimination of trapping sets and guaranteed error correction capability. Trans. Emerg. Telecommun. Technol. 27(12): 1679-1692 (2016) - 2012
- [j3]Vida Ravanmehr, Ludovic Danjean, Bane Vasic, David Declercq:
Interval-Passing Algorithm for Non-Negative Measurement Matrices: Performance and Reconstruction Analysis. IEEE J. Emerg. Sel. Topics Circuits Syst. 2(3): 424-432 (2012) - [j2]Bane Vasic, Vida Ravanmehr, Anantha Raman Krishnan:
An Information Theoretic Approach to Constructing Robust Boolean Gene Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 9(1): 52-65 (2012) - 2009
- [j1]Morteza Esmaeili, Vida Ravanmehr:
Two Classes of Optimal Stopping Redundancy Codes. Ars Comb. 92 (2009)
Conference and Workshop Papers
- 2016
- [c8]Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly threshold graphs for social network modeling. ITW 2016: 231-235 - 2015
- [c7]Bane Vasic, Predrag Ivanis, Srdan Brkic, Vida Ravanmehr:
Fault-resilient decoders and memories made of unreliable components. ITA 2015: 136-142 - 2014
- [c6]Vida Ravanmehr, David Declercq, Bane Vasic:
Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks. ISIT 2014: 701-705 - [c5]Mehrdad Khatami, Vida Ravanmehr, Bane Vasic:
GBP-based detection and symmetric information rate for rectangular-grain TDMR model. ISIT 2014: 1618-1622 - [c4]Vida Ravanmehr, David Declercq, Bane Vasic:
Check-hybrid GLDPC codes without small trapping sets. ITA 2014: 1-9 - 2012
- [c3]Vida Ravanmehr, Bane Vasic:
Quasi-cyclic codes exhibiting the gene regulatory network of the cell cycle. CIBCB 2012: 412-417 - [c2]Vida Ravanmehr, Ludovic Danjean, Bane Vasic, David Declercq:
Signal recovery performance of the interval-passing algorithm. ISTC 2012: 106-110 - 2011
- [c1]Vida Ravanmehr, Ludovic Danjean, David Declercq, Bane Vasic:
On iterative compressed sensing reconstruction of sparse non-negative vectors. ISABEL 2011: 146:1-146:5
Informal and Other Publications
- 2023
- [i5]J. Harry Caufield, Tim E. Putman, Kevin Schaper, Deepak R. Unni, Harshad Hegde, Tiffany J. Callahan, Luca Cappelletti, Sierra A. T. Moxon, Vida Ravanmehr, Seth Carbon, Lauren E. Chan, Katherina Cortes, Kent A. Shefchek, Glass Elsarboukh, James P. Balhoff, Tommaso Fontana, Nicolas Matentzoglu, Richard M. Bruskiewich, Anne E. Thessen, Nomi L. Harris, Monica C. Munoz-Torres, Melissa A. Haendel, Peter N. Robinson, Marcin P. Joachimiak, Christopher J. Mungall, Justin T. Reese:
KG-Hub - Building and Exchanging Biological Knowledge Graphs. CoRR abs/2302.10800 (2023) - 2021
- [i4]Giorgio Valentini, Elena Casiraghi, Luca Cappelletti, Vida Ravanmehr, Tommaso Fontana, Justin T. Reese, Peter N. Robinson:
Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding. CoRR abs/2101.01425 (2021) - [i3]Luca Cappelletti, Tommaso Fontana, Elena Casiraghi, Vida Ravanmehr, Tiffany J. Callahan, Marcin P. Joachimiak, Christopher J. Mungall, Peter N. Robinson, Justin T. Reese, Giorgio Valentini:
GraPE: fast and scalable Graph Processing and Embedding. CoRR abs/2110.06196 (2021) - 2016
- [i2]Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly Threshold Graphs for Social Network Modeling. CoRR abs/1603.09701 (2016) - [i1]Vida Ravanmehr, Mehrdad Khatami, David Declercq, Bane Vasic:
Check-hybrid GLDPC Codes: Systematic Elimination of Trapping Sets and Guaranteed Error Correction Capability. CoRR abs/1604.05256 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
