Sciweavers

107 search results - page 9 / 22
» Polynomially Bounded Matrix Interpretations
Sort
View
ECCC
2007
96views more  ECCC 2007»
13 years 6 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
SPIN
2010
Springer
13 years 5 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
MST
2007
167views more  MST 2007»
13 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 11 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
SAC
2010
ACM
14 years 1 months ago
Modeling cardinal directions in the 3D space with the objects interaction cube matrix
In GIS and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. However, most cardinal direction models are only able to h...
Tao Chen, Markus Schneider