default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNima Noorshams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Liu Yang, Fabian Paischer, Kaveh Hassani, Jiacheng Li, Shuai Shao, Zhang Gabriel Li, Yun He, Xue Feng, Nima Noorshams, Sem Park, Bo Long, Robert D. Nowak, Xiaoli Gao, Hamid Eghbalzadeh:
Unifying Generative and Dense Retrieval for Sequential Recommendation. CoRR abs/2411.18814 (2024)- [i6]Fabian Paischer, Liu Yang, Linfeng Liu, Shuai Shao, Kaveh Hassani, Jiacheng Li, Ricky Chen, Zhang Gabriel Li, Xialo Gao, Wei Shao, Xue Feng, Nima Noorshams, Sem Park, Bo Long, Hamid Eghbalzadeh:
Preference Discerning with LLM-Enhanced Generative Retrieval. CoRR abs/2412.08604 (2024) - 2020
- [c7]Nima Noorshams, Saurabh Verma, Aude Hofleitner:
TIES: Temporal Interaction Embeddings for Enhancing Social Media Integrity at Facebook. KDD 2020: 3128-3135 - [i5]Nima Noorshams, Saurabh Verma, Aude Hofleitner:
TIES: Temporal Interaction Embeddings For Enhancing Social Media Integrity At Facebook. CoRR abs/2002.07917 (2020)
2010 – 2019
- 2014
- [i4]Nima Noorshams, Aravind Iyengar:
A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees. CoRR abs/1405.6353 (2014) - 2013
- [b1]Nima Noorshams:
Low-Complexity Message-Passing Algorithms for Distributed Computation. University of California, Berkeley, USA, 2013 - [j3]Nima Noorshams, Martin J. Wainwright:
Belief propagation for continuous state spaces: stochastic message-passing with quantitative guarantees. J. Mach. Learn. Res. 14(1): 2799-2835 (2013) - [j2]Nima Noorshams, Martin J. Wainwright
:
Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm. IEEE Trans. Inf. Theory 59(4): 1981-2000 (2013) - [i3]Nima Noorshams, Martin J. Wainwright:
Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging with Noisy Links. CoRR abs/1302.2129 (2013) - 2012
- [c6]Nima Noorshams, Martin J. Wainwright:
Quantized stochastic belief propagation: Efficient message-passing for continuous state spaces. ISIT 2012: 1241-1245 - [i2]Nima Noorshams, Martin J. Wainwright:
Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees. CoRR abs/1212.3850 (2012) - 2011
- [j1]Nima Noorshams, Martin J. Wainwright:
Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging With Noisy Links. IEEE J. Sel. Top. Signal Process. 5(4): 833-844 (2011) - [c5]Nima Noorshams, Martin J. Wainwright:
Stochastic belief propagation: Low-complexity message-passing with guarantees. Allerton 2011: 269-276 - [c4]Sameer Pawar, Nima Noorshams, Salim Y. El Rouayheb, Kannan Ramchandran:
DRESS codes for the storage cloud: Simple randomized constructions. ISIT 2011: 2338-2342 - [i1]Nima Noorshams, Martin J. Wainwright:
Stochastic Belief Propagation: Low-Complexity Message-Passing with Guarantees. CoRR abs/1111.1020 (2011) - 2010
- [c3]Nima Noorshams, Martin J. Wainwright:
Lossy source coding with sparse graph codes: A variational formulation of soft decimation. Allerton 2010: 354-360 - [c2]Nima Noorshams, Martin J. Wainwright:
A near-optimal algorithm for network-constrained averaging with noisy links. ISIT 2010: 1768-1772
2000 – 2009
- 2007
- [c1]Nima Noorshams, Massoud Babaie-Zadeh, Christian Jutten:
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem. ICA 2007: 397-405
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 2025-01-21 21:19 CET 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:
