O. Frieder

Publications
Influence

Distributed construction of connected dominating set in wireless ad hoc networks

P. Wan, Khaled M. Alzoubi, O. Frieder
Computer Science
Proceedings.Twenty-First Annual Joint Conference…
7 November 2002

We present our own distributed algorithm that always outputs a nontrivial CDS. Expand

New distributed algorithm for connected dominating set in wireless ad hoc networks

Khaled M. Alzoubi, P. Wan, O. Frieder
Computer Science
Proceedings of the 35th Annual Hawaii…
7 January 2002

We establish a (n logn) lower bound on message complexity of any distributed algorithm for nontrivial CDS and present an algorithm that outperforms the existing algorithms. Expand

Message-optimal connected dominating sets in mobile ad hoc networks

Khaled M. Alzoubi, P. Wan, O. Frieder
Computer Science
MobiHoc '02
9 June 2002

A connected dominating set (CDS) for a graph G(V,E) is a subset V1 of V, such that each node in V--V1 is adjacent to some nodes in V1, and V1 induces a connected subgraph. Expand

Collection statistics for fast duplicate document detection

A. Chowdhury, O. Frieder, D. Grossman, M. McCabe
Computer Science
TOIS
1 April 2002

We present a new algorithm for duplicate document detection thatuses collection statistics that scales in terms of the number of documents andworks well for documents of all sizes. Expand

Information retrieval - algorithms and heuristics

D. Grossman, O. Frieder
Computer Science
The Kluwer international series in engineering…
30 September 1998

List of Figures. Preface. 1. Introduction. 2. Retrieval Strategies. 3. Retrieval Utilities. 4. Efficiency Issues pertaining to Sequential IR Systems. 5. Integrating Structured Data and Text. 6.… Expand

Efficient interference-aware TDMA link scheduling for static wireless networks

Weizhao Wang, X. Li, O. Frieder, Yu Wang, Wenzhan Song
Computer Science
MobiCom '06
29 September 2006

We study efficient link scheduling for a multihop wireless network to maximize its throughput. Expand

Minimum-energy broadcast routing in static ad hoc wireless networks

P. Wan, G. Calinescu, X. Li, O. Frieder
Computer Science
Proceedings IEEE INFOCOM . Conference on Computer…
22 April 2001

We prove that minimum-energy broadcast routing can be solved in polynomial time, despite the NP-hardness of its general graph version. Expand

Distributed heuristics for connected dominating sets in wireless ad hoc networks

Khaled M. Alzoubi, P. Wan, O. Frieder
Computer Science
Journal of Communications and Networks
1 March 2002

A connected dominating set (CDS) for a graph G(V, E) is a subset V' of V, such that each node in V is adjacent to some node in E, and V' induces a connected subgraph. Expand

On arabic search: improving the retrieval effectiveness via a light stemming approach

Mohammed Aljlayl, O. Frieder
Computer Science
CIKM '02
4 November 2002

The inflectional structure of a word impacts the retrieval accuracy of information retrieval systems of Latin-based languages. Expand

Hourly analysis of a very large topically categorized web query log

Steven M. Beitzel, E. Jensen, A. Chowdhury, D. Grossman, O. Frieder
Computer Science
SIGIR '04
25 July 2004

We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a general-purpose commercial web search service. Expand

Recommended Authors