Binary logarithm

Known as: Logarithmus dualis, Log2, Logarithmus binaris 
In mathematics, the binary logarithm (log2 n) is the power to which the number 2 must be raised to obtain the value n. That is, for any real number x… (More)
Wikipedia

Related topics

Related topics

50 relations
AKS primality testAlgorithmAnalysis of algorithmsBinary entropy function
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Practical physical layer network coding for two-way relay channels: performance analysis and comparison
This paper investigates the performance of practical physical-layer network coding (PNC) schemes for two-way relay channels. We… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Optimal Sticky Prices under Rational Inattention ∗
This paper presents a model in which price setting firms decide what to pay attention to, subject to a constraint on information… (More)
  • figure 1
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Quality-of-Service Driven Power and Rate Adaptation over Wireless Links
We propose a quality-of-service (QoS) driven power and rate adaptation scheme over wireless links in mobile wireless networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Local Graph Partitioning using PageRank Vectors
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
Adaptive Logarithmic Mapping For Displaying High Contrast Scenes
We propose a fast, high quality tone mapping technique to display high contrast images on devices with limited dynamic range of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Compressed Progressive Meshes
ÐMost systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Two Algorithms for Nearest-Neighbor Search in High Dimensions
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
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
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)
  • figure 2
  • table I
  • figure 3
  • table II
  • figure 1
Is this relevant?
Highly Cited
1972
Highly Cited
1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
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)
  • figure 1
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering Applications
An approximate method for rapid multiplication or division with relatively simple digital circuitry is described. The algorithm… (More)
  • figure 1
  • figure 2
  • table I
  • table IV
  • figure 3
Is this relevant?