default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDulal C. Kar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j8]Dulal C. Kar, Anusha Madhuri Nakka, Ajay K. Katangur:
A new statistical attack resilient steganography scheme for hiding messages in audio files. Int. J. Inf. Comput. Secur. 10(2/3): 276-302 (2018)- 2017
- [j7]Dulal C. Kar:
On Pruning of Data in a Sliding Window for Computing a Rank-Order Element. IEEE Signal Process. Lett. 24(7): 1005-1009 (2017) - 2015
- [j6]Dulal C. Kar, Clifton J. Mulkey:
A multi-threshold based audio steganography scheme. J. Inf. Secur. Appl. 23: 54-67 (2015) - 2013
- [j5]Clifton J. Mulkey, Dulal C. Kar, Ajay K. Katangur
:
An Efficient Protocol for Privacy and Authentication for Resource-Constrained Devices in Wireless Networks. Int. J. Cyber Warf. Terror. 3(2): 38-57 (2013) - 2010
- [c9]Geetha Sanapala, Dulal C. Kar:
SCIBED: A Web-Based Testbed for Wireless Sensor Networks. International Conference on Internet Computing 2010: 339-344 - [c8]Somasheker Akkaladevi, Ajay K. Katangur, Dulal C. Kar:
Implementing Security Measures for Portable Devices. ICWN 2010: 158-164 - [c7]Hung L. Ngo, Dulal C. Kar:
LPC Vocoders for Environmental Monitoring Using Wireless Sensor Networks. ICWN 2010: 593-598
2000 – 2009
- 2009
- [j4]Dulal C. Kar, Hung L. Ngo, Geetha Sanapala:
Applied Cryptography for Security and Privacy in Wireless Sensor Networks. Int. J. Inf. Secur. Priv. 3(3): 14-36 (2009) - 2006
- [c6]Dulal C. Kar, Dennis Ma:
An Application for Automatic Extraction of Objects from Digital Images. CATA 2006: 158-162 - [c5]Dulal C. Kar, Randy DeLeon:
On Fast Estimation of Network Bandwidth. Communications in Computing 2006: 3-9 - 2004
- [c4]Dulal C. Kar:
Optimal Message Routing in a Distributed Double Loop Network with Faulty Nodes and Links. CCCT (1) 2004: 366-371 - 2003
- [c3]Dulal C. Kar, V. V. Bapeswara Rao:
Routing Tables for Message Routing in Distributed Double Loop Networks. CATA 2003: 17-20 - 2002
- [c2]Dulal C. Kar, S. R. Subramanya:
A Tree-Based, Constant-Time Rank-Order Algorithm for Moving Window Filtering Applications. CAINE 2002: 45-48 - [c1]Dulal C. Kar:
Pruning of a Sliding Window for Rank-Order Filtering. CATA 2002: 98-101
1990 – 1999
- 1996
- [j3]Dulal C. Kar, V. V. Bapeswara Rao:
A CORDIC-based unified systolic architecture for sliding window applications of discrete transforms. IEEE Trans. Signal Process. 44(2): 441-444 (1996) - 1994
- [j2]Dulal C. Kar, V. V. Bapeswara Rao:
On the prime factor decomposition algorithm for the discrete sine transform. IEEE Trans. Signal Process. 42(11): 3258-3260 (1994) - 1993
- [j1]Dulal C. Kar, V. V. Bapeswara Rao:
A new systolic realization for the discrete Fourier transform. IEEE Trans. Signal Process. 41(5): 2008-2010 (1993)
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:52 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:
