Bin Fu

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
106Discovering almost any hidden motif from multiple sequences. Bin Fu, Ming-Yang Kao, Lusheng Wang. ACM Transactions on Algorithms (7): 26 (2011). Web SearchBibTeXDownload
105Minimum Interval Cover and Its Application to Genome Sequencing. Liang Ding, Bin Fu, Binhai Zhu. COCOA 2011, 287-298. Web SearchBibTeXDownload
104Algorithms for Testing Monomials in Multivariate Polynomials. Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller. COCOA 2011, 16-30. Web SearchBibTeXDownload
103Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments. Xiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu. COCOA 2011, 74-81. Web SearchBibTeXDownload
102The Complexity of Testing Monomials in Multivariate Polynomials. Zhixiang Chen, Bin Fu. COCOA 2011, 1-15. Web SearchBibTeXDownload
101Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu. COCOA 2011, 299-310. Web SearchBibTeXDownload
100On the Complexity of Approximate Sum of Sorted List. Bin Fu. CoRR (abs/1112.0520) (2011). Web SearchBibTeXDownload
99Self-Assembly with Geometric Tiles. Bin Fu, Matthew J. Patitz, Robert T. Schweller, Bobby Sheline. CoRR (abs/1104.2809) (2011). Web SearchBibTeXDownload
98Approximation schemes for parallel machine scheduling with availability constraints. Bin Fu, Yumei Huo, Hairong Zhao. Discrete Applied Mathematics (159): 1555-1565 (2011). Web SearchBibTeXDownload
97A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. Richard Beigel, Bin Fu. Electronic Colloquium on Computational Complexity (ECCC) (18): 28 (2011). Web SearchBibTeXDownload
96Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model. Zaixin Lu, Wei Zhang, Weili Wu, Bin Fu, Ding-Zhu Du. ICDCS Workshops 2011, 160-165. Web SearchBibTeXDownload
95A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance. Bin Fu, Louxin Zhang. ISBRA 2011, 297-305. Web SearchBibTeXDownload
94Separating NE from some nonuniform nondeterministic complexity classes. Bin Fu, Angsheng Li, Liyu Zhang. J. Comb. Optim. (22): 482-493 (2011). Web SearchBibTeXDownload
93Theory and application of width bounded geometric separators. Bin Fu. J. Comput. Syst. Sci. (77): 379-392 (2011). Web SearchBibTeXDownload
92Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations. Julio López, Colin Degraf, Tiziana DiMatteo, Bin Fu, Eugene Fink, Garth A. Gibson. SSDBM 2011, 546-554. Web SearchBibTeXDownload
91Linear and sublinear time algorithms for the basis of abelian groups. Li Chen, Bin Fu. Theor. Comput. Sci. (412): 4110-4122 (2011). Web SearchBibTeXDownload
90Two Sides Approximation Algorithms for Channel Assignments in Wireless Network. Chuanhe Huang, Jia Ye, Bin Fu. WASA 2011, 36-47. Web SearchBibTeXDownload
2010
89A Linear Kernel for Co-Path/Cycle Packing. Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu. AAIM 2010, 90-102. Web SearchBibTeXDownload
88Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. Bin Fu, Yumei Huo, Hairong Zhao. AAIM 2010, 141-149. Web SearchBibTeXDownload
87Efficient protein alignment algorithm for protein search. Zaixin Lu, Zhiyu Zhao, Bin Fu. BMC Bioinformatics (11): 34 (2010). Web SearchBibTeXDownload
86Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. Zhixiang Chen, Bin Fu. COCOA (1) 2010, 309-323. Web SearchBibTeXDownload
85Constant Time Approximation Scheme for Largest Well Predicted Subset. Bin Fu, Lusheng Wang. COCOON 2010, 429-438. Web SearchBibTeXDownload
84A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. Richard Beigel, Bin Fu. CoRR (abs/1007.1260) (2010). Web SearchBibTeXDownload
83Sublinear Time Motif Discovery from Multiple Sequences. Bin Fu, Yunhui Fu. CoRR (abs/1007.2618) (2010). Web SearchBibTeXDownload
82XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme. Artem Chebotko, Bin Fu. CoRR (abs/1007.2671) (2010). Web SearchBibTeXDownload
81NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets. Bin Fu. Electronic Colloquium on Computational Complexity (ECCC) (17): 196 (2010). Web SearchBibTeXDownload
80Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP. Bin Fu. Electronic Colloquium on Computational Complexity (ECCC) (17): 202 (2010). Web SearchBibTeXDownload
79The Complexity of Testing Monomials in Multivariate Polynomials. Zhixiang Chen, Bin Fu. Electronic Colloquium on Computational Complexity (ECCC) (17): 114 (2010). Web SearchBibTeXDownload
78Algorithms for Testing Monomials in Multivariate Polynomials. Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller. Electronic Colloquium on Computational Complexity (ECCC) (17): 122 (2010). Web SearchBibTeXDownload
77Approximation Schemes for Scheduling with Availability Constraints. Bin Fu, Yumei Huo, Hairong Zhao. FAW 2010, 77-88. Web SearchBibTeXDownload
76O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. Liang Ding, Bin Fu, Yunhui Fu, Zaixin Lu, Zhiyu Zhao. FAW 2010, 250-261. Web SearchBibTeXDownload
75Improved Sublinear Time Algorithm for Width-Bounded Separators. Liang Ding, Bin Fu, Yunhui Fu. FAW 2010, 101-112. Web SearchBibTeXDownload
74DiscFinder: a data-intensive scalable cluster finder for astrophysics. Bin Fu, Kai Ren, Julio López, Eugene Fink, Garth Gibson. HPDC 2010, 348-351. Web SearchBibTeXDownload
73Learning Restricted Bayesian Network Classifiers with Mixed Non-i.i.d. Sampling. Zhongfeng Wang, Zhihai Wang, Bin Fu. ICDM Workshops 2010, 899-904. Web SearchBibTeXDownload
72Learning Robust Bayesian Network Classifiers in the Space of Markov Equivalent Classes. Zhongfeng Wang, Zhihai Wang, Bin Fu. ICDM Workshops 2010, 891-898. Web SearchBibTeXDownload
71Efficient Parallel Learning of Hidden Markov Chain Models on SMPs. Lei Li, Bin Fu, Christos Faloutsos. IEICE Transactions (93-D): 1330-1342 (2010). Web SearchBibTeXDownload
70A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor. Zhixiang Chen, Bin Fu, John Abraham. J. Comb. Optim. (19): 134-157 (2010). Web SearchBibTeXDownload
2009
69On the Approximability of Some Haplotyping Problems. John Abraham, Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu. AAIM 2009, 3-14. Web SearchBibTeXDownload
68Makespan Minimization with Machine Availability Constraints. Bin Fu, Yumei Huo, Hairong Zhao. COCOA 2009, 430-437. Web SearchBibTeXDownload
67Separating NE from Some Nonuniform Nondeterministic Complexity Classes. Bin Fu, Angsheng Li, Liyu Zhang. COCOON 2009, 486-495. Web SearchBibTeXDownload
66Linear and Sublinear Time Algorithms for Basis of Abelian Groups. Li Chen, Bin Fu. ISAAC 2009, 493-502. Web SearchBibTeXDownload
65Search Similar protein Structures with Classification, Sequence and 3D alignments. Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Krishnakumar Krishnaswamy, Bin Fu. J. Bioinformatics and Computational Biology (7): 755-771 (2009). Web SearchBibTeXDownload
64On recovering syntenic blocks from comparative maps. Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu. J. Comb. Optim. (18): 307-318 (2009). Web SearchBibTeXDownload
63Separating sublinear time computations by approximate diameter. Bin Fu, Zhiyu Zhao. J. Comb. Optim. (18): 393-416 (2009). Web SearchBibTeXDownload
62Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences. Bin Fu, Ming-Yang Kao, Lusheng Wang. SIAM J. Discrete Math. (23): 1715-1737 (2009). Web SearchBibTeXDownload
61Analysis of uncertain data: Evaluation of given hypotheses. Anatole Gershman, Eugene Fink, Bin Fu, Jaime G. Carbonell. SMC 2009, 2556-2561. Web SearchBibTeXDownload
60Analysis of uncertain data: Selection of probes for information gathering. Anatole Gershman, Eugene Fink, Bin Fu, Jaime G. Carbonell. SMC 2009, 2227-2232. Web SearchBibTeXDownload
59Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. Bin Fu, Ming-Yang Kao, Lusheng Wang. TAMC 2009, 231-240. Web SearchBibTeXDownload
58Exponential inapproximability and FPTAS for scheduling with availability constraints. Bin Fu, Yumei Huo, Hairong Zhao. Theor. Comput. Sci. (410): 2663-2674 (2009). Web SearchBibTeXDownload
2008
57Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu. APBC 2008, 333-342. Web SearchBibTeXDownload
56New Algorithm and Web Server for Finding Proteins with Similar 3D Structures. Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Bin Fu. BIOCOMP 2008, 674-680. Web SearchBibTeX
55Separating Sublinear Time Computations by Approximate Diameter. Bin Fu, Zhiyu Zhao. COCOA 2008, 79-88. Web SearchBibTeXDownload
54On Recovering Syntenic Blocks from Comparative Maps. Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu. COCOA 2008, 319-327. Web SearchBibTeXDownload
53A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. Bin Fu, Zhixiang Chen. COCOON 2008, 82-91. Web SearchBibTeXDownload
52Simulation Study on the Optimal Conditions for Shallow Water Bathymetry Observation by SAR. Kaiguo Fan, Weigen Huang, Bin Fu, Mingxia He. IGARSS (1) 2008, 454-457. Web SearchBibTeXDownload
51Simulation Study on the Effect of Wind Direction on SAR Imaging Shallow Water Bathymetry. Kaiguo Fan, Weigen Huang, Mingxia He, Bin Fu, Xilin Gan. IGARSS (1) 2008, 409-412. Web SearchBibTeXDownload
50Multi-Directional Width-Bounded Geometric Separator and protein Folding. Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu. Int. J. Comput. Geometry Appl. (18): 389-413 (2008). Web SearchBibTeXDownload
49On the inapproximability of the exemplar conserved interval distance problem of genomes. Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu. J. Comb. Optim. (15): 201-221 (2008). Web SearchBibTeXDownload
48Sublinear time width-bounded separators and their application to the protein side-chain packing problem. Bin Fu, Zhixiang Chen. J. Comb. Optim. (15): 387-407 (2008). Web SearchBibTeXDownload
47Feedback Algorithm and Web-Server for Protein Structure Alignment. Zhiyu Zhao, Bin Fu, Francisco J. Alanis, Christopher M. Summa. Journal of Computational Biology (15): 505-524 (2008). Web SearchBibTeXDownload
46Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. Bin Fu, Ming-Yang Kao, Lusheng Wang. TAMC 2008, 234-245. Web SearchBibTeXDownload
2007
45An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi. AAIM 2007, 317-326. Web SearchBibTeXDownload
44A Flexible Algorithm for Pairwise Protein Structure Alignment. Zhiyu Zhao, Bin Fu. BIOCOMP 2007, 16-22. Web SearchBibTeX
43Non-breaking Similarity of Genomes with Gene Repetitions. Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu. CPM 2007, 119-130. Web SearchBibTeXDownload
42Linear and Sublinear Time Algorithms for the Basis of Abelian Groups. Li Chen, Bin Fu. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload
41On the Complexity of Approximation Streaming Algorithms for the k -Center Problem. Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu. FAW 2007, 160-171. Web SearchBibTeXDownload
40A Page Content Independent Book Dewarping Method to Handle 2D Images Captured by a Digital Camera. Minghui Wu, Rongfeng Li, Bin Fu, Wenxin Li, Zhuoqun Xu. ICIAR 2007, 1242-1253. Web SearchBibTeXDownload
39On the complexity of Rocchio's similarity-based relevance feedback algorithm. Zhixiang Chen, Bin Fu. JASIST (58): 1392-1400 (2007). Web SearchBibTeXDownload
38Software Protection by Hardware and Obfuscation. Bin Fu, Sai Aravalli, John Abraham. Security and Management 2007, 367-373. Web SearchBibTeX
37Geometric Separators and Their Applications to Protein Folding in the HP-Model. Bin Fu, Wei Wang. SIAM J. Comput. (37): 1014-1029 (2007). Web SearchBibTeXDownload
2006
36Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. Bin Fu, Zhixiang Chen. AAIM 2006, 149-160. Web SearchBibTeXDownload
35The Approximability of the Exemplar Breakpoint Distance Problem. Zhixiang Chen, Bin Fu, Binhai Zhu. AAIM 2006, 291-302. Web SearchBibTeXDownload
34Some new approaches for preventing software tampering. Bin Fu, Golden G. Richard III, Yixin Chen. ACM Southeast Regional Conference 2006, 655-660. Web SearchBibTeXDownload
33Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes. Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu. COCOON 2006, 245-254. Web SearchBibTeXDownload
32A Feature-Based Approach for Automatic Registration of NOAA AVHRR Images. Xiulin Lou, Weigen Huang, Bin Fu, Junhua Teng. IGARSS 2006, 995-998. Web SearchBibTeXDownload
31A PTAS for a disc covering problem using width-bounded separators. Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu. J. Comb. Optim. (11): 203-217 (2006). Web SearchBibTeXDownload
30Theory and Application of Width Bounded Geometric Separator. Bin Fu. STACS 2006, 277-288. Web SearchBibTeXDownload
2005
29A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm. Zhixiang Chen, Bin Fu. COCOON 2005, 955-964. Web SearchBibTeXDownload
28A PTAS for a Disc Covering Problem Using Width-Bounded Separators. Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu. COCOON 2005, 490-503. Web SearchBibTeXDownload
27Theory and Application of Width Bounded Geometric Separator. Bin Fu. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
26On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. Zhixiang Chen, Bin Fu. ISAAC 2005, 216-225. Web SearchBibTeXDownload
25Multi-directional Width-Bounded Geometric Separator and Protein Folding. Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu. ISAAC 2005, 995-1006. Web SearchBibTeXDownload
2004
24A 2O(n1-(1/d)log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model. Bin Fu, Wei Wang. ICALP 2004, 630-644. Web SearchBibTeXDownload
23Diagnosis in the Presence of Intermittent Faults. Bin Fu, Richard Beigel. ISAAC 2004, 427-441. Web SearchBibTeXDownload
2003
22Task Assignment Strategy for Overloaded Systems. Bin Fu, James Broberg, Zahir Tari. ISCC 2003, 1119-1125. Web SearchBibTeXDownload
21A Dynamic Load Distribution Strategy for Systems Under High Task Variation and Heavy Traffic. Bin Fu, Zahir Tari. SAC 2003, 1031-1037. Web SearchBibTeX
2000
20Circuits over PP and PL. Richard Beigel, Bin Fu. J. Comput. Syst. Sci. (60): 422-441 (2000). Web SearchBibTeXDownload
1999
19A Comparison of Resource-Bounded Molecular Computation Models. Bin Fu, Richard Beigel. Algorithmica (24): 87-95 (1999). Web SearchBibTeXDownload
18Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. Richard Beigel, Bin Fu. Algorithmica (25): 222-238 (1999). Web SearchBibTeXDownload
1998
17Solving Intractable Problems with DNA Computing. Richard Beigel, Bin Fu. IEEE Conference on Computational Complexity 1998, 154. Web SearchBibTeXDownload
1997
16Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. Richard Beigel, Bin Fu. ICALP 1997, 816-826. Web SearchBibTeXDownload
15Circuits Over PP and PL. Richard Beigel, Bin Fu. IEEE Conference on Computational Complexity 1997, 24-35. Web SearchBibTeXDownload
14A Comparison of Resource-Bounded Molecular Computation Models. Bin Fu, Richard Beigel. ISTCS 1997, 6-11. Web SearchBibTeXDownload
1995
13Two VLSI Design Advances in Arithmetic Coding. Bin Fu, Keshab K. Parhi. ISCAS 1995, 1440-1443. Web SearchBibTeX
12Generalized Multiplication Free Arithmetic Codes. Bin Fu, Keshab K. Parhi. ISCAS 1995, 437-440. Web SearchBibTeX
11With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets. Bin Fu. SIAM J. Comput. (24): 1082-1090 (1995). Web SearchBibTeXDownload
1994
10An Application of the Translational Method. Bin Fu, Hong-Zhou Li, Yong Zhong. Mathematical Systems Theory (27): 183-186 (1994). Web SearchBibTeXDownload
9Closeness of NP-Hard Sets to Other Complexity Classes. Bin Fu, Hong-Zhou Li. SIAM J. Comput. (23): 255-260 (1994). Web SearchBibTeXDownload
1993
8On Lower Bounds of the Closeness Between Complexity Classes. Bin Fu. Mathematical Systems Theory (26): 187-202 (1993). Web SearchBibTeXDownload
7With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. Bin Fu. Structure in Complexity Theory Conference 1993, 185-191. Web SearchBibTeX
6Exponential-Time and Subexponential-Time Sets. Shouwen Tang, Bin Fu, Tran Liu. Theor. Comput. Sci. (115): 371-381 (1993). Web SearchBibTeXDownload
5On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets. Bin Fu, Hong-Zhou Li. Theor. Comput. Sci. (120): 279-291 (1993). Web SearchBibTeXDownload
1992
4On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. Bin Fu, Hong-Zhou Li. ISAAC 1992, 439-448. Web SearchBibTeXDownload
3On Closeness of NP-Hard Sets to Other Complexity Classes. Bin Fu, Hong-Zhou Li. Structure in Complexity Theory Conference 1992, 243-248. Web SearchBibTeX
2Some Properties of Exponential Time Complexity Classes. Bin Fu, Hong-Zhou Li, Yong Zhong. Structure in Complexity Theory Conference 1992, 50-57. Web SearchBibTeX
1991
1Exponential Time and Subexponential Time Sets. Shouwen Tang, Bin Fu, Tian Liu. Structure in Complexity Theory Conference 1991, 230-237. Web SearchBibTeX
from DBLP and Google Scholar
References
1. ^ UT Dallas Computer Science – Events - Retrieved 2012-01-12 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research