# Binary logarithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- IEEE Transactions on Wireless Communications
- 2010

This paper investigates the performance of practical physical-layer network coding (PNC) schemes for two-way relay channels. We… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

This paper presents a model in which price setting firms decide what to pay attention to, subject to a constraint on information… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- IEEE Transactions on Wireless Communications
- 2007

We propose a quality-of-service (QoS) driven power and rate adaptation scheme over wireless links in mobile wireless networks… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- 47th Annual IEEE Symposium on Foundations of…
- 2006

A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Comput. Graph. Forum
- 2003

We propose a fast, high quality tone mapping technique to display high contrast images on devices with limited dynamic range of… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- IEEE Trans. Vis. Comput. Graph.
- 2000

ÐMost systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- STOC
- 1997

Representing data as points in a high-dimensional space, so as to use geometric methods for indexing, is an algorithmic technique… (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- IEEE Transactions on Computers
- 1973

An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf… (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- J. ACM
- 1972

This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general… (More)

Is this relevant?

Highly Cited

1970

Highly Cited

1970

- IEEE Transactions on Computers
- 1970

An approximate method for rapid multiplication or division with relatively simple digital circuitry is described. The algorithm… (More)

Is this relevant?