default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2023
- Aadyot Bhatnagar, Paul Kassianik, Chenghao Liu, Tian Lan, Wenzhuo Yang, Rowan Cassius, Doyen Sahoo, Devansh Arpit, Sri Subramanian, Gerald Woo, Amrita Saha, Arun Kumar Jagota, Gokulakrishnan Gopalakrishnan, Manpreet Singh, K. C. Krithika, Sukumar Maddineni, Dae-ki Cho, Bo Zong, Yingbo Zhou, Caiming Xiong, Silvio Savarese, Steven C. H. Hoi, Huan Wang:
Merlion: End-to-End Machine Learning for Time Series. J. Mach. Learn. Res. 24: 226:1-226:6 (2023) - 2021
- Aadyot Bhatnagar, Paul Kassianik, Chenghao Liu, Tian Lan, Wenzhuo Yang, Rowan Cassius, Doyen Sahoo, Devansh Arpit, Sri Subramanian, Gerald Woo, Amrita Saha, Arun Kumar Jagota, Gokulakrishnan Gopalakrishnan, Manpreet Singh, K. C. Krithika, Sukumar Maddineni, Dae-ki Cho, Bo Zong, Yingbo Zhou, Caiming Xiong, Silvio Savarese, Steven C. H. Hoi, Huan Wang:
Merlion: A Machine Learning Library for Time Series. CoRR abs/2109.09265 (2021) - 2005
- Andrea Di Blas, Arun Jagota, Richard Hughey:
Optimizing neural networks on SIMD parallel computers. Parallel Comput. 31(1): 97-115 (2005) - 2003
- Andrea Di Blas, Arun Jagota, Richard Hughey:
A Range-Compaction Heuristic for Graph Coloring. J. Heuristics 9(6): 489-506 (2003) - 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
- Nigel J. Duffy, Arun K. Jagota:
Connectionist Password Quality Tester. IEEE Trans. Knowl. Data Eng. 14(4): 920-922 (2002) - Andrea Di Blas, Arun Jagota, Richard Hughey:
Energy function-based approaches to graph coloring. IEEE Trans. Neural Networks 13(1): 81-91 (2002) - Sören Sonnenburg, Gunnar Rätsch, Arun K. Jagota, Klaus-Robert Müller:
New Methods for Splice Site Recognition. ICANN 2002: 329-336 - 2001
- Arun K. Jagota, Giri Narasimhan, Lubomír Soltés:
A Generalization of maximal independent sets. Discret. Appl. Math. 109(3): 223-235 (2001) - Arun Jagota, Laura A. Sanchis:
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. J. Heuristics 7(6): 565-585 (2001) - 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 - 2000
- Arun Jagota, Marcello Pelillo, Anand Rangarajan:
A New Deterministic Annealing Algorithm for Maximum Clique. IJCNN (6) 2000: 505-508 - 1999
- Arun K. Jagota:
Hopfield Neural Networks and Self-Stabilization. Chic. J. Theor. Comput. Sci. 1999 (1999) - Nigel P. Duffy, Arun K. Jagota:
Generalized Connectionist Associative Memory. IJCAI 1999: 833-839 - 1998
- Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan:
Information capacity of binary weights associative memories. Neurocomputing 19(1-3): 35-58 (1998) - 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) - 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
- Dmitri Kaznachey, Arun K. Jagota:
Approximating Minimum Set Cover in a Hopfield-Style Network. Inf. Sci. 98(1-4): 203-216 (1997) - 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) - Dmitri Kaznachey, Arun K. Jagota, Sajal K. Das:
Primal-target neural net heuristics for the hypergraph k-coloring problem. ICNN 1997: 1251-1255 - Arun K. Jagota, Rina Dechter:
Simple distributed algorithms for the cycle cutset problem. SAC 1997: 366-373 - 1996
- Arun K. Jagota, Joerg Ueberla, Dmitri Kaznachey:
A hybrid connectionist associative memory with perfect storage. Fuzzy Sets Syst. 82(2): 213-222 (1996) - Laura A. Sanchis, Arun Jagota:
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem. INFORMS J. Comput. 8(2): 87-102 (1996) - 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) - Brenton Chapin, Arun Jagota:
Good Rings in Grids with Bad Nodes. PDPTA 1996: 725-733 - 1995
- Arun Jagota:
Approximating maximum clique with a Hopfield network. IEEE Trans. Neural Networks 6(3): 724-735 (1995) - Arun K. Jagota:
A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network. IPPS 1995: 331-337 - Xin Wang, Arun K. Jagota, Fernanda Botelho, Max H. Garzon:
Absence of Cycles in Symmetric Neural Networks. NIPS 1995: 372-378 - 1994
- Arun Jagota:
Contextual word recognition with a Hopfield-style net. Neural Parallel Sci. Comput. 2(2): 245-271 (1994) - 1993
- Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan:
Approximately solving Maximum Clique using neural network and related heuristics. Cliques, Coloring, and Satisfiability 1993: 169-204
skipping 5 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-15 22:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint