Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Distributed construction of connected dominating set in wireless ad hoc networks
- P. Wan, K. Alzoubi, O. Frieder
- Computer ScienceProceedings.Twenty-First Annual Joint Conference…
- 7 November 2002
This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, which is thus message-optimal.
New distributed algorithm for connected dominating set in wireless ad hoc networks
This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDs, which is thus message-optimal.
Message-optimal connected dominating sets in mobile ad hoc networks
This paper proposes the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a emph constant approximation ratio, and emph linear time and emphlinear message complexity.
Collection statistics for fast duplicate document detection
A new algorithm for duplicate document detection that uses collection statistics and shows that the approach, called I-Match, scales in terms of the number of documents and works well for documents of all sizes.
Efficient interference-aware TDMA link scheduling for static wireless networks
- Weizhao Wang, Xiangyang Li, O. Frieder, Yu Wang, Wen-Zhan Song
- Computer ScienceMobiCom '06
- 29 September 2006
Using a mathematical formulation, synchronized TDMA link schedulings that optimize the networking throughput are developed that are both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum.
Information retrieval - algorithms and heuristics
- D. Grossman, O. Frieder
- Computer ScienceThe Kluwer international series in engineering…
- 30 September 1998
This paper presents a meta-modelling architecture that automates the very labor-intensive and therefore time-heavy and expensive process of integrating structured data and text into a discrete-time system.
Minimum-energy broadcast routing in static ad hoc wireless networks
- P. Wan, G. Calinescu, Xiangyang Li, O. Frieder
- Computer ScienceProceedings IEEE INFOCOM . Conference on Computer…
- 22 April 2001
By exploring geometric structures of Euclidean MSTs, it is proved that the approximation ratio of MST is between 6 and 12, and the approximation ratios of BIP is between /sup 13///sub 3/ and 12; these are the first analytical results for minimum-energy broadcasting.
Distributed heuristics for connected dominating sets in wireless ad hoc networks
Two destributed heuristics with constant performance ratios are proposed, which require only single-hop neighborhood knowledge, and a message length of O (1) and O(n log n), respectively.
On arabic search: improving the retrieval effectiveness via a light stemming approach
This work proposes a novel light-stemming algorithm for Arabic texts that significantly outperforms the root-based algorithm and shows that a significant improvement in retrieval precision can be achieved with light inflectional analysis of Arabic words.
Hourly analysis of a very large topically categorized web query log
- S. Beitzel, Eric C. Jensen, Abdur Chowdhury, D. Grossman, O. Frieder
- Computer ScienceSIGIR '04
- 25 July 2004
It is shown that query traffic from particular topical categories differs both from the query stream as a whole and from other categories, which is relevant to the development of enhanced query disambiguation, routing, and caching algorithms.