default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Saad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c25]Ruijie Luo, Yi-Zhi Xu, Robin Matzner, Georgios Zervas, David Saad, Polina Bayvel:
Message Passing: Towards Low-Complexity, Global Optimal Routing and Wavelength Assignment Solutions for Optical Networks. OFC 2022: 1-3- 2021
- [i18]Yi-Zhi Xu, Ho Fai Po, Chi Ho Yeung, David Saad:
Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing. CoRR abs/2107.00609 (2021) - 2020
- [i17]Alexander Mozeika, Bo Li, David Saad:
The Space of Functions Computed By Deep Layered Machines. CoRR abs/2004.08930 (2020)
2010 – 2019
- 2019
- [i16]Bo Li, David Saad:
Large Deviation Analysis of Function Sensitivity in Random Deep Neural Networks. CoRR abs/1910.05769 (2019) - [i15]Andrey Y. Lokhov, David Saad:
Scalable Influence Estimation Without Sampling. CoRR abs/1912.12749 (2019) - 2018
- [i14]Mihai-Alin Badiu, David Saad, Justin P. Coon:
Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks. CoRR abs/1808.03643 (2018) - 2017
- [j22]Andrey Y. Lokhov
, David Saad:
Optimal deployment of resources for maximizing impact in spreading processes. Proc. Natl. Acad. Sci. USA 114(39): E8138-E8146 (2017) - [i13]Bo Li, David Saad:
Exploring the Function Space of Deep-Learning Machines. CoRR abs/1708.01422 (2017) - 2016
- [j21]K. Y. Michael Wong, David Saad, Chi Ho Yeung:
Distributed Optimization in Transportation and Logistics Networks. IEICE Trans. Commun. 99-B(11): 2237-2246 (2016) - [i12]Andrey Y. Lokhov, David Saad:
Optimal Deployment of Resources for Maximizing Impact in Spreading Processes. CoRR abs/1608.08278 (2016) - 2015
- [j20]Alexander Mozeika, David Saad:
On Reliable Computation by Noisy Random Boolean Formulas. IEEE Trans. Inf. Theory 61(1): 637-644 (2015) - 2014
- [j19]David Saad, Chi Ho Yeung, Georgios Rodolakis, Dimitris Syrivelis, Iordanis Koutsopoulos, Leandros Tassiulas, Rüdiger L. Urbanke, Paolo Giaccone, Emilio Leonardi:
Physics-inspired methods for networking and communications. IEEE Commun. Mag. 52(11): 144-151 (2014) - [i11]Caterina De Bacco, Silvio Franz, David Saad, Chi Ho Yeung:
Shortest node-disjoint paths on random graphs. CoRR abs/1401.8096 (2014) - 2013
- [c24]Hamed Mahmoudi, Georgios Rodolakis, Leonidas Georgiadis, David Saad:
Message-passing algorithms for optimal utilization of cognitive radio networks. ICC Workshops 2013: 1393-1397 - [i10]Chi Ho Yeung, David Saad, K. Y. Michael Wong:
From the Physics of Interacting Polymers to Optimizing Routes on the London Underground. CoRR abs/1309.0745 (2013) - [i9]Hamed Mahmoudi, Georgios Rodolakis, Leonidas Georgiadis, David Saad:
Message-Passing Algorithms for Optimal Utilization of Cognitive Radio Networks. CoRR abs/1310.5468 (2013) - 2012
- [i8]Chi Ho Yeung, David Saad:
The Competition for Shortest Paths on Sparse Graphs. CoRR abs/1202.0213 (2012) - 2011
- [i7]Chi Ho Yeung, David Saad:
Networks and Networking - A Statistical Physics Perspective. CoRR abs/1110.2931 (2011) - 2010
- [i6]Joerg Reichardt, Roberto Alamino, David Saad:
The interplay of microscopic and mesoscopic structure in complex networks. CoRR abs/1012.4524 (2010)
2000 – 2009
- 2009
- [i5]Alexander Mozeika, David Saad, Jack Raymond:
Computing with Noise - Phase Transitions in Boolean Formulas. CoRR abs/0908.3981 (2009) - 2008
- [c23]K. Y. Michael Wong, David Saad, Chi Ho Yeung:
Network optimisation - A statistical physics perspective. WiOpt 2008: 577-582 - [c22]Roberto Alamino, David Saad:
Typical performance of generalised vector channels. WiOpt 2008: 598-602 - [c21]Jack Raymond, David Saad:
Randomness and metastability in CDMA paradigms. WiOpt 2008: 626-630 - [i4]Jack Raymond, David Saad:
Composite CDMA - A statistical mechanics analysis. CoRR abs/0811.2403 (2008) - 2007
- [i3]Jack Raymond, David Saad:
Sparsely-spread CDMA - a statistical mechanics based analysis. CoRR abs/0704.0098 (2007) - [i2]K. Y. Michael Wong, David Saad:
Minimizing Unsatisfaction in Colorful Neighborhoods. CoRR abs/0704.3835 (2007) - 2006
- [c20]K. Y. Michael Wong, Chi Ho Yeung, David Saad:
Message-Passing for Inference and Optimization of Real Variables on Sparse Graphs. ICONIP (2) 2006: 754-763 - 2005
- [c19]Stéphane Bounkong, Borémi Toch, David Saad:
Optimal Embedding for Watermarking in Discrete Data Spaces. Information Hiding 2005: 77-90 - [c18]K. Y. Michael Wong, David Saad, Zhuo Gao:
Message passing for task redistribution on sparse graphs. NIPS 2005: 1529-1536 - [i1]Juan P. Neirotti, David Saad:
Improved message passing for inference in densely connected systems. CoRR abs/cs/0503070 (2005) - 2003
- [j18]Stéphane Bounkong, Borémi Toch, David Saad, David Lowe:
ICA for Watermarking Digital Images. J. Mach. Learn. Res. 4: 1471-1498 (2003) - [c17]Borémi Toch, David Lowe, David Saad:
Watermarking of audio signals using independent component analysis. WEDELMUSIC 2003: 71-74 - 2002
- [c16]Stéphane Bounkong, David Saad, David Lowe:
Independent Component Analysis for Domain Independent Watermarking. ICANN 2002: 510-515 - 2001
- [c15]Jort van Mourik, David Saad, Yoshiyuki Kabashima:
Weight vs. Magnetization Enumerator for Gallager Codes. IMACC 2001: 148-157 - [c14]David Saad, Yoshiyuki Kabashima, Tatsuto Murayama, Renato Vicente:
Statistical Physics of Low Density Parity Check Error Correcting Codes. IMACC 2001: 307-316 - 2000
- [c13]Renato Vicente, David Saad, Yoshiyuki Kabashima:
Error-correcting Codes on a Bethe-like Lattice. NIPS 2000: 322-328
1990 – 1999
- 1999
- [c12]Yoshiyuki Kabashima, Tatsuto Murayama, David Saad, Renato Vicente:
Regular and Irregular Gallager-zype Error-Correcting Codes. NIPS 1999: 272-278 - 1998
- [c11]Anthony C. C. Coolen, David Saad:
Dynamics of Supervised Learning with Restricted Training Sets. NIPS 1998: 197-203 - [c10]Yoshiyuki Kabashima, David Saad:
The Belief in TAP. NIPS 1998: 246-252 - [p1]Jason A. S. Freeman, Mark J. L. Orr, David Saad:
Statistical theories of learning in radial basis function networks. Algorithms and Architectures 1998: 1-59 - 1997
- [j17]Jason A. S. Freeman, David Saad:
Online Learning in Radial Basis Function Networks. Neural Comput. 9(7): 1601-1622 (1997) - [j16]Barak Cohen, David Saad, Emanuel Marom:
Efficient Training of Recurrent Neural Network with Time Delays. Neural Networks 10(1): 51-59 (1997) - [c9]Todd K. Leen, Bernhard Schottky, David Saad:
Two Approaches to Optimal Annealing. NIPS 1997: 301-307 - [c8]Magnus Rattray, David Saad:
Globally Optimal On-line Learning Rules. NIPS 1997: 322-328 - 1996
- [j15]David Barber, David Saad:
Does Extra Knowledge Necessarily Improve Generalization? Neural Comput. 8(1): 202-214 (1996) - [j14]David Saad:
General Gaussian Priors for Improved Generalization. Neural Networks 9(6): 937-945 (1996) - [j13]Jason A. S. Freeman, David Saad:
Radial Basis Function Networks: Generalization in Over-realizable and Unrealizable Scenarios. Neural Networks 9(9): 1521-1529 (1996) - [c7]David Saad, Sara A. Solla:
Learning with Noise and Regularizers in Multilayer Neural Networks. NIPS 1996: 260-266 - [c6]Ansgar Heinrich Ludolf West, David Saad, Ian T. Nabney:
The Learning Dynamcis of a Universal Approximator. NIPS 1996: 288-294 - 1995
- [j12]David Barber, David Saad, Peter Sollich:
Test Error Fluctuations in Finite Linear Perceptrons. Neural Comput. 7(4): 809-821 (1995) - [j11]Jason A. S. Freeman, David Saad:
Learning and generalization in radial basis function networks. Neural Comput. 7(5): 1000-1020 (1995) - [c5]David Barber, David Saad:
Knowledge and generalisation in simple learning systems. ESANN 1995 - [c4]David Saad, Sara A. Solla:
Dynamics of On-Line Gradient Descent Learning for Multilayer Neural Networks. NIPS 1995: 302-308 - [c3]Ansgar Heinrich Ludolf West, David Saad:
Adaptive Back-Propagation in On-Line Learning of Multilayer Networks. NIPS 1995: 323-329 - 1994
- [c2]Glenn Marion, David Saad:
Hyperparameters Evidence and Generalisation for an Unrealisable Rule. NIPS 1994: 255-262 - [c1]Peter Sollich, David Saad:
Learning from queries for maximum information gain in imperfectly learnable problems. NIPS 1994: 287-294 - 1993
- [j10]Nachum Shamir, David Saad, Emanuel Marom:
Preserving the Diversity of a Genetically Evolving Population of Nets Using the Functional Behavior of Neurons. Complex Syst. 7(5) (1993) - [j9]Nachum Shamir, David Saad, Emanuel Marom:
Using the Functional Behavior of Neurons for Genetic Recombination in Neural Nets Training. Complex Syst. 7(6) (1993) - [j8]Nachum Shamir, David Saad, Emanuel Marom:
Neural Net Pruning Based On Functional Behavior Of Neurons. Int. J. Neural Syst. 4(2): 143-158 (1993) - [j7]Shai Abramson, David Saad, Emanuel Marom:
Training a network with ternary weights using the CHIR algorithm. IEEE Trans. Neural Networks 4(6): 997-1000 (1993) - 1992
- [b1]David Saad:
Improving training methods in neural networks via modification of the internal representations. Tel Aviv University, Israel, 1992 - [j6]David Saad:
Training Recurrent Neural Networks via Trajectory Modification. Complex Syst. 6(3) (1992) - [j5]David Saad:
Training Recurrent Neural Networks - The Minimal Trajectory Algorithm. Int. J. Neural Syst. 3(1): 83-101 (1992) - [j4]David Saad, R. Sasson:
Examining the Chir Algorithm Performance for Multilayer Networks and Continuous Input Vectors. Int. J. Neural Syst. 3(2): 157-165 (1992) - 1991
- [j3]Stan Franklin, Max H. Garzon, David E. Goldberg, Bradley Korb, Kalyanmoy Deb, Francesca Aicardi, Andrzej Lech Kawczynski, Wentian Li, Norman H. Packard, David Saad, Emanuel Marom:
Complex Systems: Errata and Changes Volumes 3 and 4. Complex Syst. 5(1) (1991) - 1990
- [j2]David Saad, Emanuel Marom:
Learning by Choice of Internal Representations: An Energy Minimization Approach. Complex Syst. 4(1) (1990) - [j1]David Saad, Emanuel Marom:
Training Feed Forward Nets with Binary Weights via a Modified CHIR Algorithm. Complex Syst. 4(5) (1990)
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-09-20 00:39 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:
