Остановите войну!
for scientists:
default search action
Debajyoti Bera
- > Home > Persons > Debajyoti Bera
Publications
- 2023
- [j12]Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Sen, Tanmoy Chakraborty:
QUINT: Node Embedding Using Network Hashing. IEEE Trans. Knowl. Data Eng. 35(3): 2987-3000 (2023) - [j11]Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma:
Dimensionality Reduction for Categorical Data. IEEE Trans. Knowl. Data Eng. 35(4): 3658-3671 (2023) - 2022
- [j10]Bhisham Dev Verma, Rameshwar Pratap, Debajyoti Bera:
Efficient binary embedding of categorical data using BinSketch. Data Min. Knowl. Discov. 36(2): 537-565 (2022) - 2021
- [c16]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
SMIM Framework to Generalize High-Utility Itemset Mining. ADMA 2021: 3-15 - [i19]Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Sen, Tanmoy Chakraborty:
QUINT: Node embedding using network hashing. CoRR abs/2109.04206 (2021) - [i17]Bhisham Dev Verma, Rameshwar Pratap, Debajyoti Bera:
Efficient Binary Embedding of Categorical Data using BinSketch. CoRR abs/2111.07163 (2021) - [i16]Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma:
Dimensionality Reduction for Categorical Data. CoRR abs/2112.00362 (2021) - 2020
- [c14]Baani Leen Kaur Jolly, Lavina Jain, Debajyoti Bera, Tanmoy Chakraborty:
Unsupervised Anomaly Detection in Journal-Level Citation Networks. JCDL 2020: 27-36 - [i15]Baani Leen Kaur Jolly, Lavina Jain, Debajyoti Bera, Tanmoy Chakraborty:
Unsupervised Anomaly Detection in Journal-Level Citation Networks. CoRR abs/2005.14343 (2020) - 2019
- [j9]Anuj Shanker Saxena, Debajyoti Bera, Vikram Goyal:
Modeling location obfuscation for continuous query. J. Inf. Secur. Appl. 44: 130-143 (2019) - [c13]Rameshwar Pratap, Debajyoti Bera, Karthik Revanuru:
Efficient Sketching Algorithm for Sparse Binary Data. ICDM 2019: 508-517 - [i12]Rameshwar Pratap, Debajyoti Bera, Karthik Revanuru:
Efficient Sketching Algorithm for Sparse Binary Data. CoRR abs/1910.04658 (2019) - [i11]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
A one-phase tree-based algorithm for mining high-utility itemsets from a transaction database. CoRR abs/1911.07151 (2019) - [i10]Anuj Shanker Saxena, Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
Mining Top-k Trajectory-Patterns from Anonymized Data. CoRR abs/1912.01861 (2019) - 2018
- [j8]Debarshi Dutta, Meher Chaitanya, Kishore Kothapalli, Debajyoti Bera:
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems. Int. J. Netw. Comput. 8(1): 73-92 (2018) - [e1]Srinivas Aluru, Ananth Kalyanaraman, Debajyoti Bera, Kishore Kothapalli, David Abramson, Ilkay Altintas, Sanjukta Bhowmick, Madhu Govindaraju, Smruti Ranjan Sarangi, Sushil K. Prasad, Steven Bogaerts, Vikas Saxena, Sanjay Goel:
2018 Eleventh International Conference on Contemporary Computing, IC3 2018, Noida, India, August 2-4, 2018. IEEE Computer Society 2018, ISBN 978-1-5386-6834-4 [contents] - [i8]Siddharth Dawar, Debajyoti Bera, Vikram Goyal:
High-utility itemset mining for subadditive monotone utility functions. CoRR abs/1812.07208 (2018) - 2017
- [j6]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl. Intell. 47(3): 809-827 (2017) - [c9]Debarshi Dutta, Meher Chaitanya, Kishore Kothapalli, Debajyoti Bera:
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems. IPDPS Workshops 2017: 864-873 - [i7]Jyoti Leeka, Srikanta Bedathur, Debajyoti Bera, Sriram Lakshminarasimhan:
STREAK: An Efficient Engine for Processing Top-k SPARQL Queries with Spatial Filters. CoRR abs/1710.07411 (2017) - 2016
- [c8]Jyoti Leeka, Srikanta Bedathur, Debajyoti Bera, Medha Atre:
Quark-X: An Efficient Top-K Processing Framework for RDF Quad Stores. CIKM 2016: 831-840 - [c7]Debajyoti Bera, Rameshwar Pratap:
Frequent-Itemset Mining Using Locality-Sensitive Hashing. COCOON 2016: 143-155 - [c6]Charudatt Pachorkar, Meher Chaitanya, Kishore Kothapalli, Debajyoti Bera:
Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality. HiPC 2016: 301-310 - [c5]Anuj Shanker Saxena, Vikram Goyal, Debajyoti Bera:
Mintra: Mining anonymized trajectories with annotations. IDEAS 2016: 105-114 - [i6]Debajyoti Bera, Rameshwar Pratap:
Frequent-Itemset Mining using Locality-Sensitive Hashing. CoRR abs/1603.01682 (2016) - 2015
- [c4]Pankaj Sahu, Prachi Agrawal, Vikram Goyal, Debajyoti Bera:
Finding RkNN Set in Directed Graphs. ICDCIT 2015: 162-173 - [i4]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
Efficient Reverse k Nearest Neighbor evaluation for hierarchical index. CoRR abs/1506.04867 (2015) - 2013
- [c3]Anuj Shanker Saxena, Vikram Goyal, Debajyoti Bera:
Efficient Enforcement of Privacy for Moving Object Trajectories. ICISS 2013: 360-374 - 2011
- [c2]Anuj Shanker Saxena, Mayank Pundir, Vikram Goyal, Debajyoti Bera:
Preserving Location Privacy for Continuous Queries on Known Route. ICISS 2011: 265-279
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-12-15 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint