Search
Selected: B

Bounds on Codes Based on Graph Theory

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on Covering Codes with the Rank Metric

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on Key Appearance Equivocation for Substitution Ciphers

Computer Science – Information Theory
Scientific paper

  [ 3.85 ] – very good Voters 1   Comments 0

Bounds on monotone switching networks for directed connectivity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on ordered codes and orthogonal arrays

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on Query Convergence

Computer Science – Learning
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on sample size for policy evaluation in Markov environments

Computer Science – Learning
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on series-parallel slowdown

Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on Space-Time-Frequency Dimensionality

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on Stability and Latency in Wireless Communication

Computer Science – Networking and Internet Architecture
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Achievable Rate for the Fading Relay Channel with Finite Input Constellations

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Automata Size for Presburger Arithmetic

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the capacity of OFDM underspread frequency selective fading channels

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Capacity of the Blockwise Noncoherent APSK-AWGN Channels

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Capacity of the Relay Channel with Noncausal State at Source

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Capacity of the Relay Channel with States at the Source

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the coefficients of the characteristic and minimal polynomials

Computer Science – Symbolic Computation
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

Computer Science – Computational Geometry
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.