Sciweavers

171 search results - page 16 / 35
» Weak theories of linear algebra
Sort
View
AAAI
1990
13 years 8 months ago
Skolem Functions and Equality in Automated Deduction
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
William McCune
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 11 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 4 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
MP
2006
88views more  MP 2006»
13 years 6 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 1 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés