Search

Your search keyword '"Fang, Qizhi"' showing total 43 results
Start Over Author "Fang, Qizhi" Publication Type Books
43 results on '"Fang, Qizhi"'

42. Top-d Rank Aggregation in Web Meta-search Engine.

Author

Fang, Qizhi, Xiao, Han, and Zhu, Shanfeng

Abstract

In this paper, we consider the rank aggregation problem for information retrieval over Web making use of a kind of metric, the coherence, which considers both the normalized Kendall-τ distance and the size of overlap between two partial rankings. In general, the top-d coherence aggregation problem is defined as: given collection of partial rankings π = {τ1,τ2, … , τK}, how to find a final ranking Π with specific length d, which maximizes the total coherence ]> . The corresponding complexity and algorithmic issues are discussed in this paper. Our main technical contribution is a polynomial time approximation scheme (PTAS) for a restricted top-d coherence aggregation problem. [ABSTRACT FROM AUTHOR]

Published
2010
Full Text
View/download PDF

43. Call Control and Routing in SONET Rings.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Chen, Bo, Paterson, Mike, Zhang, Guochuan, Chen, Shuqiang, and Fang, Qizhi

Abstract

In this paper, we provide a polynomial-time approximation algorithm for Call Control and Routing problems in SONET rings. In this problem, we are given a SONET ring and a set of calls, each of which is described by a source-destination pair of nodes together with an integer specifying the call demand, the aim is to devise a routing scheme such that the total demand transmitted is maximum subject to the bandwidth restriction. We first give an $\cal NP$-hardness proof for this problem. Then a polynomial-time approximation algorithm is provided. When $d_{max}\leq \frac{1}{K}d^* $ (where K > 2 is a constant, d* is the available bandwidth of the ring and dmax is the largest call demand among all the calls), the algorithm outputs a routing scheme with total demand transmitted at least as $(1-\frac{7}{2K+3})$ times the optimum. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results