Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Xiao, Shaun"'
Publikováno v:
Cancer Biology & Medicine, Vol 13, Iss 3, Pp 389-395 (2016)
Primary peritoneal carcinoma (PPC) is a type of rare malignant epithelial tumor. Metastasis from PPC to breast has been rarely reported. PPC originates de novo from the peritoneal tissues rather than invasion or metastasis from adjacent or remote org
Externí odkaz:
https://doaj.org/article/7fd0c3c0fedc4324b003e683a17e2767
Publikováno v:
The Review of Corporate Finance Studies.
We examine the effect of short sellers on corporate innovation. To establish causality, we use a policy experiment that exogenously removes the short-selling constraint for a randomly selected subsample of Russell 3000 firms. We find that innovation
Autor:
Fox, Elizabeth, Razzouk, Bassem I., Widemann, Brigitte C., Xiao, Shaun, O'Brien, Michelle, Goodspeed, Wendy, Reaman, Gregory H., Blaney, Susan M., Murgo, Anthony J., Balis, Frank M., Adamson, Peter C.
Publikováno v:
In Blood 15 January 2008 111(2):566-573
Publikováno v:
SSRN Electronic Journal.
The U.S. equity markets have experienced a remarkable decline in IPOs since 2000, both in terms of smaller IPO volume and entrepreneurial firms’ greater tendency to exit through acquisitions rather than IPOs. Using proprietary U.S. Census data on p
Publikováno v:
IEEE Symposium on Security and Privacy
We design and develop Obli VM, a programming framework for secure computation. ObliVM offers a domain specific language designed for compilation of programs into efficient oblivious representations suitable for secure computation. ObliVM offers a pow
Publikováno v:
IEEE Symposium on Security and Privacy
We propose introducing modern parallel programming paradigms to secure computation, enabling their secure execution on large datasets. To address this challenge, we present Graph SC, a framework that (i) provides a programming paradigm that allows no
Autor:
Xiao Shaun Wang, Elaine Shi, T-H. Hubert Chan, Emil Stefanov, Kartik Nayak, Chang Liu, Yan Huang
Publikováno v:
ACM Conference on Computer and Communications Security
We design novel, asymptotically more efficient data structures and algorithms for programs whose data access patterns exhibit some degree of predictability. To this end, we propose two novel techniques, a pointer-based technique and a locality-based
Publikováno v:
ACM Conference on Computer and Communications Security
Oblivious RAMs (ORAMs) have traditionally been measured by their bandwidth overhead and client storage. We observe that when using ORAMs to build secure computation protocols for RAM programs, the size of the ORAM circuits is more relevant to the per
Publikováno v:
2015 IEEE Symposium on Security & Privacy; 2015, p377-394, 18p
Publikováno v:
2015 IEEE Symposium on Security & Privacy; 2015, p359-376, 18p