Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: C. Ramya
@inproceedings{DBLP:conf/innovations/RamyaS24,
author = {C. Ramya and
Pratik Shastri},
editor = {Venkatesan Guruswami},
title = {Lower Bounds for Planar Arithmetic Circuits},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {91:1--91:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.91},
doi = {10.4230/LIPICS.ITCS.2024.91},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/RamyaS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Arvind0GMR23,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Utsab Ghosal and
Partha Mukhopadhyay and
C. Ramya},
editor = {Yael Tauman Kalai},
title = {On Identity Testing and Noncommutative Rank Computation over the Free
Skew Field},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {6:1--6:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.6},
doi = {10.4230/LIPICS.ITCS.2023.6},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Arvind0GMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RamyaS23,
author = {C. Ramya and
Pratik Shastri},
title = {Lower Bounds for Planar Arithmetic Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-202}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/202},
eprinttype = {ECCC},
eprint = {TR23-202},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/RamyaS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcoss/SubramanianERKR22,
author = {Malliga Subramanian and
Sathishkumar V. E. and
C. Ramya and
Shanmuga Vadivel Kogilavani and
Deepti Ravi},
title = {A Lightweight Depthwise Separable Convolution Neural Network for Screening
Covid-19 Infection from Chest {CT} and X-ray Images},
booktitle = {18th International Conference on Distributed Computing in Sensor Systems,
{DCOSS} 2022, Marina del Rey, Los Angeles, CA, USA, May 30 - June
1, 2022},
pages = {410--413},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/DCOSS54816.2022.00072},
doi = {10.1109/DCOSS54816.2022.00072},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcoss/SubramanianERKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/0001RST22,
author = {Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {If {VNP} Is Hard, Then so Are Equations for It},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {44:1--44:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.44},
doi = {10.4230/LIPICS.STACS.2022.44},
timestamp = {Sat, 12 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/0001RST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RamyaT22,
author = {C. Ramya and
Anamay Tengse},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {On Finer Separations Between Subclasses of Read-Once Oblivious ABPs},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {53:1--53:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.53},
doi = {10.4230/LIPICS.STACS.2022.53},
timestamp = {Sat, 12 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/RamyaT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-06432,
author = {C. Ramya and
Anamay Tengse},
title = {On Finer Separations between Subclasses of Read-once Oblivious ABPs},
journal = {CoRR},
volume = {abs/2201.06432},
year = {2022},
url = {https://arxiv.org/abs/2201.06432},
eprinttype = {arXiv},
eprint = {2201.06432},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-06432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-04797,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Utsab Ghosal and
Partha Mukhopadhyay and
C. Ramya},
title = {On Identity Testing and Noncommutative Rank Computation over the Free
Skew Field},
journal = {CoRR},
volume = {abs/2209.04797},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.04797},
doi = {10.48550/ARXIV.2209.04797},
eprinttype = {arXiv},
eprint = {2209.04797},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-04797.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RamyaT22,
author = {C. Ramya and
Anamay Tengse},
title = {On Finer Separations between Subclasses of Read-once Oblivious ABPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-009}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/009},
eprinttype = {ECCC},
eprint = {TR22-009},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/RamyaT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cssp/PriyaR21,
author = {C. Priya and
C. Ramya},
title = {Robust and Secure Video Watermarking Based on Cellular Automata and
Singular Value Decomposition for Copyright Protection},
journal = {Circuits Syst. Signal Process.},
volume = {40},
number = {5},
pages = {2464--2493},
year = {2021},
url = {https://doi.org/10.1007/s00034-020-01585-6},
doi = {10.1007/S00034-020-01585-6},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cssp/PriyaR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmihi/KumarR21,
author = {N. Rathina Kumar and
C. Ramya},
title = {An Enhanced Hybrid Watermarking Method and Imaging System for Securing
Medical Images},
journal = {J. Medical Imaging Health Informatics},
volume = {11},
number = {11},
pages = {2754--2764},
year = {2021},
url = {https://doi.org/10.1166/jmihi.2021.3867},
doi = {10.1166/JMIHI.2021.3867},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmihi/KumarR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-14371,
author = {C. Ramya and
K. S. Shreedhara},
title = {A {PSO} Strategy of Finding Relevant Web Documents using a New Similarity
Measure},
journal = {CoRR},
volume = {abs/2103.14371},
year = {2021},
url = {https://arxiv.org/abs/2103.14371},
eprinttype = {arXiv},
eprint = {2103.14371},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-14371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RamyaR20,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Lower bounds for special cases of syntactic multilinear ABPs},
journal = {Theor. Comput. Sci.},
volume = {809},
pages = {1--20},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.10.047},
doi = {10.1016/J.TCS.2019.10.047},
timestamp = {Fri, 31 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RamyaR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chatterjee0RST20,
author = {Prerona Chatterjee and
Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
editor = {Sandy Irani},
title = {On the Existence of Algebraically Natural Proofs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {870--880},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00085},
doi = {10.1109/FOCS46700.2020.00085},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chatterjee0RST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-14147,
author = {Prerona Chatterjee and
Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
title = {On the Existence of Algebraically Natural Proofs},
journal = {CoRR},
volume = {abs/2004.14147},
year = {2020},
url = {https://arxiv.org/abs/2004.14147},
eprinttype = {arXiv},
eprint = {2004.14147},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-14147.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-09460,
author = {C. Ramya},
title = {Recent Progress on Matrix Rigidity - {A} Survey},
journal = {CoRR},
volume = {abs/2009.09460},
year = {2020},
url = {https://arxiv.org/abs/2009.09460},
eprinttype = {arXiv},
eprint = {2009.09460},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-09460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-07056,
author = {Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
title = {If {VNP} is hard, then so are equations for it},
journal = {CoRR},
volume = {abs/2012.07056},
year = {2020},
url = {https://arxiv.org/abs/2012.07056},
eprinttype = {arXiv},
eprint = {2012.07056},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-07056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChatterjeeKRST20,
author = {Prerona Chatterjee and
Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
title = {On the Existence of Algebraically Natural Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-063}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/063},
eprinttype = {ECCC},
eprint = {TR20-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChatterjeeKRST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarRST20,
author = {Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
title = {If {VNP} is hard, then so are equations for it},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-187}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/187},
eprinttype = {ECCC},
eprint = {TR20-187},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarRST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RamyaR19,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Linear projections of the Vandermonde polynomial},
journal = {Theor. Comput. Sci.},
volume = {795},
pages = {165--182},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.06.010},
doi = {10.1016/J.TCS.2019.06.010},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RamyaR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/RamyaR19,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Lower bounds for Sum and Sum of Products of Read-once Formulas},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {2},
pages = {10:1--10:27},
year = {2019},
url = {https://doi.org/10.1145/3313232},
doi = {10.1145/3313232},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/RamyaR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RamyaR19,
author = {C. Ramya and
B. V. Raghavendra Rao},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Lower Bounds for Multilinear Order-Restricted ABPs},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {52:1--52:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.52},
doi = {10.4230/LIPICS.MFCS.2019.52},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/RamyaR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-04377,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Lower bounds for multilinear bounded order ABPs},
journal = {CoRR},
volume = {abs/1901.04377},
year = {2019},
url = {http://arxiv.org/abs/1901.04377},
eprinttype = {arXiv},
eprint = {1901.04377},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-04377.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/NarayanaswamyDR18,
author = {N. S. Narayanaswamy and
S. M. Dhannya and
C. Ramya},
editor = {Lusheng Wang and
Daming Zhu},
title = {Minimum Membership Hitting Sets of Axis Parallel Segments},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {638--649},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_53},
doi = {10.1007/978-3-319-94776-1\_53},
timestamp = {Thu, 20 Aug 2020 16:02:36 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/NarayanaswamyDR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/RamyaR18,
author = {C. Ramya and
B. V. Raghavendra Rao},
editor = {Lusheng Wang and
Daming Zhu},
title = {Lower Bounds for Special Cases of Syntactic Multilinear ABPs},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {701--712},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_58},
doi = {10.1007/978-3-319-94776-1\_58},
timestamp = {Fri, 29 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/RamyaR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-08810,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Lower Bounds for Special Cases of Syntactic Multilinear ABPs},
journal = {CoRR},
volume = {abs/1804.08810},
year = {2018},
url = {http://arxiv.org/abs/1804.08810},
eprinttype = {arXiv},
eprint = {1804.08810},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-08810.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RamyaR17,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Linear Projections of the Vandermonde Polynomial},
journal = {CoRR},
volume = {abs/1705.03188},
year = {2017},
url = {http://arxiv.org/abs/1705.03188},
eprinttype = {arXiv},
eprint = {1705.03188},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RamyaR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RamyaR17,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Linear Projections of the Vandermonde Polynomial},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-086}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/086},
eprinttype = {ECCC},
eprint = {TR17-086},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RamyaR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CR16,
author = {Ramya C. and
B. V. Raghavendra Rao},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {Sum of Products of Read-Once Formulas},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.39},
doi = {10.4230/LIPICS.FSTTCS.2016.39},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RamyaR15,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Limitations of sum of products of Read-Once Polynomials},
journal = {CoRR},
volume = {abs/1512.03607},
year = {2015},
url = {http://arxiv.org/abs/1512.03607},
eprinttype = {arXiv},
eprint = {1512.03607},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RamyaR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RamyaR15,
author = {C. Ramya and
B. V. Raghavendra Rao},
title = {Limitations of sum of products of Read-Once Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-201}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/201},
eprinttype = {ECCC},
eprint = {TR15-201},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RamyaR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-1938,
author = {C. Ramya and
G. Kavitha and
K. S. Shreedhara},
title = {Dynamic Grouping of Web Users Based on Their Web Access Patterns using
{ART1} Neural Network Clustering Algorithm},
journal = {CoRR},
volume = {abs/1205.1938},
year = {2012},
url = {http://arxiv.org/abs/1205.1938},
eprinttype = {arXiv},
eprint = {1205.1938},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-1938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2284,
author = {C. Ramya and
K. S. Shreedhara and
G. Kavitha},
title = {Preprocessing: {A} Prerequisite for Discovering Patterns in {WUM}
Process},
journal = {CoRR},
volume = {abs/1104.2284},
year = {2011},
url = {http://arxiv.org/abs/1104.2284},
eprinttype = {arXiv},
eprint = {1104.2284},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2284.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0332,
author = {C. Ramya and
G. Kavitha and
K. S. Shreedhara},
title = {Recalling of Images using Hopfield Neural Network Model},
journal = {CoRR},
volume = {abs/1105.0332},
year = {2011},
url = {http://arxiv.org/abs/1105.0332},
eprinttype = {arXiv},
eprint = {1105.0332},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0350,
author = {C. Ramya and
G. Kavitha and
K. S. Shreedhara},
title = {Preprocessing: {A} Prerequisite for Discovering Patterns in Web Usage
Mining Process},
journal = {CoRR},
volume = {abs/1105.0350},
year = {2011},
url = {http://arxiv.org/abs/1105.0350},
eprinttype = {arXiv},
eprint = {1105.0350},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1211,
author = {C. Ramya and
G. Kavitha},
title = {An Efficient Preprocessing Methodology for Discovering Patterns and
Clustering of Web Users using a Dynamic {ART1} Neural Network},
journal = {CoRR},
volume = {abs/1109.1211},
year = {2011},
url = {http://arxiv.org/abs/1109.1211},
eprinttype = {arXiv},
eprint = {1109.1211},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1211.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:44 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:
