default search action
Sirin Nitinawarat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c22]Taweesin Wongpinkaew, Sipat Triukose, Sirin Nitinawarat, Krerk Piromsopa:
Hospital Volunteer Management Process Digitalization Through Service Design: Design Decision and Implementation. APIT 2021: 47-53 - 2020
- [c21]Kuladech Rashataprucksa, Chavalit Chuangchaichatchavarn, Sipat Triukose, Sirin Nitinawarat, Marisa Pongprutthipan, Krerk Piromsopa:
Acne Detection with Deep Neural Networks. IPMV 2020: 53-56
2010 – 2019
- 2015
- [c20]Yun Li, Sirin Nitinawarat, Yu Su, Venugopal V. Veeravalli:
Universal outlier hypothesis testing: Application to anomaly detection. ICASSP 2015: 5595-5599 - [c19]Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal quickest outlier detection and isolation. ISIT 2015: 770-774 - [c18]Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal scheme for optimal search and stop. ITA 2015: 322-328 - 2014
- [j6]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal Outlier Hypothesis Testing. IEEE Trans. Inf. Theory 60(7): 4066-4082 (2014) - [c17]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal sequential outlier hypothesis testing. ACSSC 2014: 281-285 - [c16]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal sequential outlier hypothesis testing. ISIT 2014: 3205-3209 - 2013
- [j5]Sirin Nitinawarat, George K. Atia, Venugopal V. Veeravalli:
Controlled Sensing for Multihypothesis Testing. IEEE Trans. Autom. Control. 58(10): 2451-2464 (2013) - [j4]Sirin Nitinawarat:
On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding. IEEE Trans. Inf. Theory 59(5): 2683-2693 (2013) - [c15]Sirin Nitinawarat, Venugopal V. Veeravalli:
Controlled sensing for sequential multihypothesis testing with non-uniform sensing cost. ACSSC 2013: 1095-1099 - [c14]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal multiple outlier hypothesis testing. CAMSAP 2013: 177-180 - [c13]Sirin Nitinawarat, Venugopal V. Veeravalli:
Controlled sensing for multihypothesis testing based on Markovian observations. ISIT 2013: 2199-2203 - [c12]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal outlier hypothesis testing. ISIT 2013: 2666-2670 - [c11]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal outlier detection. ITA 2013: 1-5 - [i5]Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal Outlier Detection. CoRR abs/1302.4776 (2013) - 2012
- [j3]Sirin Nitinawarat, Prakash Narayan:
Secret Key Generation for Correlated Gaussian Sources. IEEE Trans. Inf. Theory 58(6): 3373-3391 (2012) - [c10]Sirin Nitinawarat, George K. Atia, Venugopal V. Veeravalli:
Controlled sensing for hypothesis testing. ICASSP 2012: 5277-5280 - [i4]Sirin Nitinawarat, George K. Atia, Venugopal V. Veeravalli:
Controlled Sensing for Multihypothesis Testing. CoRR abs/1205.0858 (2012) - 2011
- [c9]Sirin Nitinawarat, George K. Atia, Venugopal V. Veeravalli:
Efficient target tracking using mobile sensors. CAMSAP 2011: 405-408 - [c8]Sirin Nitinawarat:
On maximal error capacity regions of Symmetric Gaussian Multiple-Access Channels. ISIT 2011: 2258-2262 - 2010
- [b1]Sirin Nitinawarat:
Information Theoretic Secret Key Generation: Structured codes and Tree Packing. University of Maryland, College Park, MD, USA, 2010 - [j2]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. IEEE Trans. Inf. Theory 56(12): 6482-6489 (2010) - [j1]Sirin Nitinawarat, Prakash Narayan:
Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing. IEEE Trans. Inf. Theory 56(12): 6490-6500 (2010) - [c7]Sirin Nitinawarat:
On the deterministic code capacity region of an arbitrarily varying multiple-access channel under list decoding. ISIT 2010: 290-294 - [c6]Sirin Nitinawarat, Prakash Narayan:
Perfect secrecy and combinatorial tree packing. ISIT 2010: 2622-2626 - [c5]Sirin Nitinawarat, Prakash Narayan:
Perfect omniscience, perfect secrecy and Steiner tree packing. ITA 2010: 362-366 - [i3]Sirin Nitinawarat:
On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding. CoRR abs/1006.2498 (2010) - [i2]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. CoRR abs/1007.3518 (2010) - [i1]Sirin Nitinawarat, Prakash Narayan:
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing. CoRR abs/1008.1079 (2010)
2000 – 2009
- 2009
- [c4]Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Chunxuan Ye, Alex Reznik:
Perfect secrecy, perfect omniscience and steiner tree packing. ISIT 2009: 1288-1292 - 2008
- [c3]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Common Randomness, Multiuser Secrecy and Tree Packing. Allerton 2008: 217-220 - [c2]Sirin Nitinawarat:
Secret key generation for correlated Gaussian sources. ISIT 2008: 702-706 - [c1]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret key generation for a pairwise independent network model. ISIT 2008: 1015-1019
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-05-08 00:10 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: