Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Xu, Bojian"'
Autor:
Nguyen, Trong Duc, Shih, Ming-Hung, Parvathaneni, Sai Sree, Xu, Bojian, Srivastava, Divesh, Tirthapura, Srikanta
Random sampling has been widely used in approximate query processing on large databases, due to its potential to significantly reduce resource usage and response times, at the cost of a small approximation error. We consider random sampling for answe
Externí odkaz:
http://arxiv.org/abs/1909.02629
Stratified random sampling (SRS) is a fundamental sampling technique that provides accurate estimates for aggregate queries using a small size sample, and has been used widely for approximate query processing. A key question in SRS is how to partitio
Externí odkaz:
http://arxiv.org/abs/1801.09039
Autor:
Wilbers, Janine G. E., Xu, Bojian, Bobbert, Peter A., de Jong, Michel P., van der Wiel, Wilfred G.
We report charge transport measurements in nanoscale vertical pillar structures incorporating ultrathin layers of the organic semiconductor poly(3-hexylthiophene)(P3HT). P3HT layers with thickness down to 5 nm are gently top-contacted using wedging t
Externí odkaz:
http://arxiv.org/abs/1701.03679
We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as computational biology. We design a generic in-place framework that fi
Externí odkaz:
http://arxiv.org/abs/1512.00378
Autor:
Xu, Bojian
A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substring(s) covering a particular string position (point query). In this paper, we extend the longes
Externí odkaz:
http://arxiv.org/abs/1511.02393
In this work, we propose a library that enables on a cloud the creation and management of tree data structures from a cloud client. As a proof of concept, we implement a new cloud service CloudTree. With CloudTree, users are able to organize big data
Externí odkaz:
http://arxiv.org/abs/1505.00043
Autor:
Tian, Yun, Xu, Bojian
Repeat finding in strings has important applications in subfields such as computational biology. The challenge of finding the longest repeats covering particular string positions was recently proposed and solved by \.{I}leri et al., using a total of
Externí odkaz:
http://arxiv.org/abs/1501.06663
Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study the proble
Externí odkaz:
http://arxiv.org/abs/1501.06259
Autor:
Xu, Bojian.
Thesis (Ph.D.)--Iowa State University, 2009.
Title from PDF title page (ProQuest website, viewed on March 29, 2009) Includes bibliography.
Title from PDF title page (ProQuest website, viewed on March 29, 2009) Includes bibliography.
Autor:
Xu, Bojian, Guo, Yuanyuan, Barman, Jitesh, Erné, Ben H., Deng, Yong, Zhou, Guofu, Groenewold, Jan
Publikováno v:
In Results in Physics September 2020 18