Остановите войну!
for scientists:
default search action
K. P. Unnikrishnan
- > Home > Persons > K. P. Unnikrishnan
Publications
- 2010
- [j11]P. S. Sastry, K. P. Unnikrishnan:
Conditional Probability-Based Significance Tests for Sequential Patterns in Multineuronal Spike Trains. Neural Comput. 22(4): 1025-1059 (2010) - [i7]Raajay Viswanathan, P. S. Sastry, K. P. Unnikrishnan:
Efficient Discovery of Large Synchronous Events in Neural Spike Streams. CoRR abs/1006.1543 (2010) - 2009
- [i6]Casey O. Diekman, Kohinoor Dasgupta, Vijay N. Nair, P. S. Sastry, K. P. Unnikrishnan:
Statistical Inference of Functional Connectivity in Neuronal Networks using Frequent Episodes. CoRR abs/0902.3725 (2009) - [i5]Srivatsan Laxman, Basel Shadid, P. S. Sastry, K. P. Unnikrishnan:
Temporal data mining for root-cause analysis of machine faults in automotive assembly lines. CoRR abs/0904.4608 (2009) - 2008
- [j10]Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishnan:
Inferring neuronal network connectivity from spike data: A temporal data mining approach. Sci. Program. 16(1): 49-77 (2008) - [i4]Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishnan:
Inferring Neuronal Network Connectivity from Spike Data: A Temporal Datamining Approach. CoRR abs/0803.0450 (2008) - [i3]P. S. Sastry, K. P. Unnikrishnan:
Conditional probability based significance tests for sequential patterns in multi-neuronal spike trains. CoRR abs/0808.3511 (2008) - 2007
- [j9]Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan:
Discovering Frequent Generalized Episodes When Events Persist for Different Durations. IEEE Trans. Knowl. Data Eng. 19(9): 1188-1201 (2007) - [c2]Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan:
A fast algorithm for finding frequent episodes in event streams. KDD 2007: 410-419 - [i2]Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishnan:
Inferring Neuronal Network Connectivity using Time-constrained Episodes. CoRR abs/0709.0218 (2007) - [i1]K. P. Unnikrishnan, Debprakash Patnaik, P. S. Sastry:
Discovering Patterns in Multi-neuronal Spike Trains using the Frequent Episode Method. CoRR abs/0709.0566 (2007) - 2006
- [j8]K. P. Unnikrishnan, Naren Ramakrishnan, P. S. Sastry, Ramasamy Uthurusamy:
Network reconstruction from dynamic data. SIGKDD Explor. 8(2): 90-91 (2006) - 2005
- [j7]Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan:
Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection. IEEE Trans. Knowl. Data Eng. 17(11): 1505-1517 (2005) - 2002
- [j5]P. S. Sastry, M. Magesh, K. P. Unnikrishnan:
Two Timescale Analysis of the Alopex Algorithm for Optimization. Neural Comput. 14(11): 2729-2750 (2002) - 1994
- [j3]P. S. Sastry, G. Santharam, K. P. Unnikrishnan:
Memory neuron networks for identification and control of dynamical systems. IEEE Trans. Neural Networks 5(2): 306-319 (1994)
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 2023-09-27 22:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint