Jinhui Xu

Publication List Details

Period

1998 - 2009

Number

22

Co-Authors

Geometric Spanner of Objects under L1 Distance (Computing and Combinatorics) (2008)

Zhu, Yongding, Xu, Jinhui, Yang, Yang, Katoh, Naoki, Tanigawa, Shin-ichi

Computing and combinatorics : 14th annual international conference, COCOON 2008, Dalian, China, June 27-29, 2008 : proceedings : (Lecture notes in computer science ; 5092)

y (2007)

Yingping Huang, Jinhui Xu, Danny Z. Chen

We prove the maximum number of geometric permutations, induced by line transversals to a set of n pairwise disjoint congruent spheres in R d with d 3, is no more than 4 when n is sufficiently large,...

An Efficient Direct Approach for Computing Shortest Rectilinear Paths among Obstacles in a Two-Layer Interconnection Model (2007)

Danny Z. Chen, Jinhui Xu

In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a two-layer interconnection model. The previously best...

y (2007)

Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu

The problem of optimizing the sum of m linear fractional functions (SOLF) in a xed dimension d, subject to n linear constraints, arises in a number of theoretical and applied areas. This paper...

y (2007)

Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu

The problem of optimizing the sum of m linear fractional functions (SOLF) in a xed dimension d, subject to n linear constraints, arises in a number of theoretical and applied areas. This paper...

Robustness of Algorithm for k-Gon Voronoi Diagram Construction (2007)

Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu

In this paper, we investigate the robustness of a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2-dimensional space using a distance metric...

Non-breaking Similarity of Genomes with Gene Repetitions,”, submitted for publication (2007)

Zhixiang Chen, Bin Fu, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu

Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, between any two...

Geometric Spanner of Segments (Algorithms and Computation) (2007)

Yang, Yang, Zhu, Yongding, Xu, Jinhui, Katoh, Naoki

Algorithms and computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings ; ISAAC 2007 : (Lecture notes in computer science ; 4835)

Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope (2006)

Yulai Xie, Jinhui Xu

In this paper, we consider the problem of computing a maximum inscribed sphere inside a high dimensional polytope formed by a set of halfspaces (or linear constraints), and present an efficient...

The chemical composition of inorganic and carbonaceous materials in PM2.5 in Nanjing, China (2005)

Yang, Hong, Yu, Jianzhen, Ho, Sai Hang, Xu, Jinhui, Wu, Wai-Shing, Wan, Chun Hong, ...

PM2.5samples were collected at an urban and a suburban site in Nanjing, China in 2001. They were analyzed for inorganic ions, elemental carbon, organic carbon (OC), water-soluble organic carbon...

Maximizing throughput for optical burst switching networks (2004)

Jikai Li, Chunming Qiao, Jinhui Xu, Dahai Xu

Abstract — A key problem in Optical Burst Switching (OBS) is to schedule as many bursts as possible on wavelength channels so that the throughput is maximized and the burst loss is minimized....

Efficient channel scheduling algorithms in optical burst switched networks (2003)

Jinhui Xu, Chunming Qiao, Jikai Li, Guang Xu

Abstract — Optical Burst Switching(OBS) is a promising paradigm for the next-generation Internet. In OBS, a key problem is to schedule bursts on wavelength channels whose bandwidth may become...

Optimizing the sum of linear fractional functions and applications (2000)

Chen, Danny Z., Daescu, Ovidiu, Dai, Yang, Katoh, Naoki, Wu, Xiadong, Xu, Jinhui

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 9-11, 2000 -- T.p. verso ; This symposium was sponsored by the ACM Special Interest...

Finding an Optimal Path without Growing the Tree (1998)

Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu, Jinhui Xu

. In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal paths for these...

Customer Satisfaction Evaluation for Mobile Commerce Services based On Grey Clustering Relational Method (1970)

Jinsong Gao, Jinhui Xu, Weijun Wang

Since mobile commerce is a new commerce mode, there is a significant meaning to research on customer satisfaction with its services. This paper evaluates the customer satisfaction with m-commerce...

Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry*

Xu, Jinhui, Xu, Guang, Chen, Zhenming, Singh, Vikas, Hoffmann, Kenneth R.

Biplane projection imaging is one of the primary methods for imaging and visualizing the cardiovascular system in medicine. A key problem in such a technique is to determine the imaging geometry...

Effects of point configuration on the accuracy in 3D reconstruction from biplane images

Dmochowski, Jacek, Hoffmann, Kenneth R., Singh, Vikas, Xu, Jinhui, Nazareth, Daryl P.

Two or more angiograms are being used frequently in medical imaging to reconstruct locations in three-dimensional (3D) space, e.g., for reconstruction of 3D vascular trees, implanted electrodes, or...