Xinxing Chen

  • Citations Per Year
Learn More
In this work, we study a novel query type, called top-<i>k,m</i> queries. Suppose we are given a set of groups and each group contains a set of attributes, each of which is associated with a ranked list of tuples, with ID and score. All lists are ranked in decreasing order of the scores of tuples. We are interested in finding the best combinations of(More)
In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile {f(n), n ∈ Z}. One interesting result is that two independent simple random walks on the wedge comb will collide infinitely many times if f(n) has a growth order as n log n. On the other hand, if {f(n);n ∈ Z} are(More)
  • 1