J. Cardinal

Publications164
h-index22
Citations1,613
Highly Influential Citations86
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • S. Langerman
  • 242 Publications • 2,857 Citations
  • M. Sharir
  • 665 Publications • 26,226 Citations
  • J. Pach
  • 514 Publications • 12,912 Citations
  • J. Iacono
  • 151 Publications • 1,995 Citations
  • Publications
  • Influence
Reconciliation of a quantum-distributed Gaussian key
TLDR
A novel construction is presented that allows the legitimate parties to get equal bit strings out of correlated variables by using a classical channel, with as little leaked information as possible, which opens the way to securely correcting nonbinary key elements.
View on IEEE
Non-cooperative facility location and covering games
View via Publisher
Intersection Graphs of Rays and Grounded Segments
TLDR
Several classes of intersection graphs of line segments in the plane are considered and it is shown that not every intersection graph of rays is an intersections graph of downward rays, and not every outer segment graph is an intersectiongraph of rays.
View PDF on arXiv
Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula
In the case of univariate polynomials, the Bezoutian \( {{\left( {P\left( x \right) - P\left( y \right)} \right)} \over {\left( {x - y} \right)}} \) defines a quadratic form of maximal rank whose…
View via Publisher
Selfish Service Installation in Networks
TLDR
This model is a non-cooperative vertex cover game for k players, which considers the task of finding approximate Nash equilibria purchasing an approximation to the optimum social cost, in which each player can improve her contribution by selfish defection only by at most a certain factor.
View via Publisher
Empty region graphs
View via Publisher
Min-max-min Geometric Facility Location Problems
We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred to a customer, where the…
On the complexity of rate-distortion optimal streaming of packetized media
TLDR
It is proved that the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network is NP-hard and efficient branch and bound algorithms are provided that are in practice much faster than the best known solution.
View on IEEE
On a property of Cauchy-like matrices
View via Publisher
Fast search for entropy-constrained VQ
  • J. Cardinal
  • Computer Science
    Proceedings 10th International Conference on…
  • 27 September 1999
TLDR
A fast linear search algorithm for entropy-constrained vector quantizers, which use a modified distortion measure taking into account the entropy of the output, is presented.
View on IEEE
...
...