Zhixiang Chen

Affiliations:
  • University of Texas Rio Grande Valley, Department of Computer Science, Edinburg, TX, USA
  • University of Texas-Pan American, Department of Computer Science, Edinburg, TX, USA (former)
  • Southwest State University, Department of Mathematics and Computer Science, Marshall, MN, USA (1995 - 1997)
  • Boston University, Department of Computer Science, MA, USA (PhD 1996)
  • Huazhong University of Science and Technology, Department of Computer Science and Engineering, Wuhan, China (former)


According to our database1, Zhixiang Chen authored at least 71 papers between 1987 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Exponential Time Approximation Scheme for TSP.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2016
Introduction: Special issue dedicated to the memory of professor Wenqi Huang.
J. Comb. Optim., 2016

2014
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.
Theor. Comput. Sci., 2014

2013
On testing monomials in multivariate polynomials.
Theor. Comput. Sci., 2013

Faster Deterministic Algorithms for Packing, Matching and t-Dominating Set Problems.
CoRR, 2013

2012
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2010
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor.
J. Comb. Optim., 2010

Algorithms for Testing Monomials in Multivariate Polynomials.
Electron. Colloquium Comput. Complex., 2010

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials.
Electron. Colloquium Comput. Complex., 2010

The Complexity of Testing Monomials in Multivariate Polynomials.
Electron. Colloquium Comput. Complex., 2010

2009
On recovering syntenic blocks from comparative maps.
J. Comb. Optim., 2009

On the Approximability of Some Haplotyping Problems.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Sublinear time width-bounded separators and their application to the protein side-chain packing problem.
J. Comb. Optim., 2008

On the inapproximability of the exemplar conserved interval distance problem of genomes.
J. Comb. Optim., 2008

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.
J. Comput. Biol., 2008

A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Capabilities of outlier detection schemes in large datasets, framework and methodologies.
Knowl. Inf. Syst., 2007

Erratum.
J. Assoc. Inf. Sci. Technol., 2007

On the complexity of Rocchio's similarity-based relevance feedback algorithm.
J. Assoc. Inf. Sci. Technol., 2007

On the Complexity of Approximation Streaming Algorithms for the <i>k</i> -Center Problem.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

Non-breaking Similarity of Genomes with Gene Repetitions.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
A PTAS for a disc covering problem using width-bounded separators.
J. Comb. Optim., 2006

Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Distributed Biomedical Database for Public Health Research.
Proceedings of the 19th IEEE International Symposium on Computer-Based Medical Systems (CBMS 2006), 2006

The Approximability of the Exemplar Breakpoint Distance Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Efficient Mining of Temporal Traversal Patterns From Very Large Web Logs.
Proceedings of The 2005 International Conference on Data Mining, 2005

A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Web Search via Learning from Relevance Feedback.
Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005

2004
Efficient optimal surface detection: theory, implementation, and experimental validation.
Proceedings of the Medical Imaging 2004: Image Processing, 2004

On User-oriented Measurements of Effectiveness of Web Information Retrieval Systems.
Proceedings of the International Conference on Internet Computing, 2004

ANTES: A Web-Based Acanthosis Nigricans and other Obesity Related Information System.
Proceedings of the International Conference on Internet Computing, 2004

Measuring Topic Bias in Web Search.
Proceedings of the International Conference on Internet Computing, 2004

2003
Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs.
World Wide Web, 2003

A Multiplicative Gradient Descent Search Algorithm fo User Preference Retrieval and its Application to Web Search.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Linear Time Algorithms for Finding Maximal Forward References.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Modeling and Efficient Mining of Intentional Knowledge of Outliers.
Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), 2003

Linear and Sublinear Time Algorithms for Mining Frequent Traversal Path Patterns from Very Large Web Logs.
Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), 2003

Personalized Web Search with Clusters.
Proceedings of the International Conference on Internet Computing, 2003

On Complementarity of Cluster and Outlier Detection Schemes.
Proceedings of the Data Warehousing and Knowledge Discovery, 5th International Conference, 2003

Fast Construction of Generalized Suffix Trees Over a Very Large Alphabet.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
WebSail: From On-line Learning to Web Search.
Knowl. Inf. Syst., 2002

Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm.
Inf. Retr., 2002

Enhancing Effectiveness of Outlier Detections for Low Density Patterns.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2002

MARS: Applying Multiplicative Adaptive User Preference Retrieval to Web Search.
Proceedings of the International Conference on Internet Computing, 2002

2001
FEATURES: Real-time adaptive feature and document learning for web search.
J. Assoc. Inf. Sci. Technol., 2001

PAWS: Personalized Adaptive Web Search.
Proceedings of WebNet 2001, 2001

The Architecture of Yarrow: A Real-Time Intelligent Meta-Search Engine.
Proceedings of the International Conference on Internet Computing, 2001

Multiplicative Adaptive Algorithms for User Preference Retrieval.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

On the Planar Two-Watchtower Problem.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
A Visualization System using Data Mining Techniques for Identifying Information Sources.
Proceedings of WebNet 2000 - World Conference on the WWW and Internet, San Antonio, Texas, USA, October 30, 2000

Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Searching the Web with Queries.
Knowl. Inf. Syst., 1999

The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space.
J. Comput. Syst. Sci., 1999

Applications of multilayer feedforward networks on WWW document search.
Proceedings of the International Joint Conference Neural Networks, 1999

Strategies for Personalized Search Engines.
Proceedings of the International Conference on Artificial Intelligence, 1999

1998
A Parallel Computing Architecture for Information Processing: Visualizing, Indexing, and Mining.
Proceedings of WebNet 98, 1998

1997
Learning Counting Functions with Queries.
Theor. Comput. Sci., 1997

1996
The Bounded Injury Priority Method and the Learnability of Unions of Rectangles.
Ann. Pure Appl. Log., 1996

Finding a Hidden Code by Asking Questions.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
On the Learnability of <i>Z</i><sub>n</sub>-DNF Formulas (Extended Abstract).
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
On-Line Learning of Rectangles and Unions of Rectangles.
Mach. Learn., 1994

On Learning Discretized Geometric Concepts (Extended Abstract)
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership Queries.
Proceedings of the Algorithmic Learning Theory, 1994

1993
Learning Unions of Two Rectangles in the Plane with Equivalence Queries.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
On-line Learning of Rectangles.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

A Solution of the Credit Assignment Problem in the Case of Learning Rectangles (Abstract).
Proceedings of the Analogical and Inductive Inference, 1992

1989
On Splitting of a Recursive Set with Polynomial Time Minimal Pairs.
Math. Log. Q., 1989

1987
The hardness of the grid problem <i>G<sub>i</sub></i> Under the Routine Resolution Method.
Math. Log. Q., 1987


  Loading...