default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArun K. Jagota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j11]Dmitri Kaznachey, Arun K. Jagota, Sajal K. Das
:
Neural network-based heuristic algorithms for hypergraph coloring problems with applications. J. Parallel Distributed Comput. 63(9): 786-800 (2003)- 2002
- [j10]Nigel J. Duffy, Arun K. Jagota:
Connectionist Password Quality Tester. IEEE Trans. Knowl. Data Eng. 14(4): 920-922 (2002) - [c9]Sören Sonnenburg, Gunnar Rätsch, Arun K. Jagota, Klaus-Robert Müller:
New Methods for Splice Site Recognition. ICANN 2002: 329-336 - 2001
- [j9]Arun K. Jagota, Giri Narasimhan, Lubomír Soltés:
A Generalization of maximal independent sets. Discret. Appl. Math. 109(3): 223-235 (2001) - [c8]Arun K. Jagota, Rune B. Lyngsø, Christian N. S. Pedersen:
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar. WABI 2001: 69-94
1990 – 1999
- 1999
- [j8]Arun K. Jagota:
Hopfield Neural Networks and Self-Stabilization. Chic. J. Theor. Comput. Sci. 1999 (1999) - [c7]Nigel P. Duffy, Arun K. Jagota:
Generalized Connectionist Associative Memory. IJCAI 1999: 833-839 - 1998
- [j7]Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan:
Information capacity of binary weights associative memories. Neurocomputing 19(1-3): 35-58 (1998) - [j6]Arun K. Jagota, Jacek Mandziuk:
Experimental Study of Perceptron-Type Local Learning Rule for Hopfield Associative Memory. Inf. Sci. 111(1-4): 65-81 (1998) - [j5]Xin Wang, Arun K. Jagota, Fernanda Botelho, Max H. Garzon:
Absence of Cycles in Symmetric Neural Networks. Neural Comput. 10(5): 1235-1249 (1998) - 1997
- [j4]Dmitri Kaznachey, Arun K. Jagota:
Approximating Minimum Set Cover in a Hopfield-Style Network. Inf. Sci. 98(1-4): 203-216 (1997) - [j3]Arun K. Jagota, Kenneth W. Regan:
Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs. J. Glob. Optim. 10(4): 439-465 (1997) - [c6]Dmitri Kaznachey, Arun K. Jagota, Sajal K. Das:
Primal-target neural net heuristics for the hypergraph k-coloring problem. ICNN 1997: 1251-1255 - [c5]Arun K. Jagota, Rina Dechter:
Simple distributed algorithms for the cycle cutset problem. SAC 1997: 366-373 - 1996
- [j2]Arun K. Jagota, Joerg Ueberla, Dmitri Kaznachey:
A hybrid connectionist associative memory with perfect storage. Fuzzy Sets Syst. 82(2): 213-222 (1996) - [j1]Arun K. Jagota, Fernanda Botelho, Max H. Garzon:
Decoding independent sets from an analog Hopfield network. Neural Parallel Sci. Comput. 4(3): 263-276 (1996) - 1995
- [c4]Arun K. Jagota:
A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network. IPPS 1995: 331-337 - [c3]Xin Wang, Arun K. Jagota, Fernanda Botelho, Max H. Garzon:
Absence of Cycles in Symmetric Neural Networks. NIPS 1995: 372-378 - 1993
- [c2]Joerg Ueberla, Arun K. Jagota:
The hybrid Hopfield-clique memory with perfect storage. ICNN 1993: 895-900 - [c1]Arun K. Jagota:
Neural Network Models for Optimization Problems. NIPS 1993: 1184-1185
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-04-25 05:55 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:
