Sciweavers

77 search results - page 10 / 16
» Explicit constructions of RIP matrices and related problems
Sort
View
DIAGRAMS
2006
Springer
13 years 9 months ago
From Diagrams to Models by Analogical Transfer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
Patrick W. Yaner, Ashok K. Goel
FOCS
2002
IEEE
14 years 15 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
IJCAI
2001
13 years 9 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
PE
2002
Springer
132views Optimization» more  PE 2002»
13 years 7 months ago
Performance evaluation with temporal rewards
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
Jeroen Voeten
VLDB
1991
ACM
196views Database» more  VLDB 1991»
13 years 11 months ago
Kaleidoscope Data Model for An English-like Query Language
Most database interfaces provide poor guidance on ad hoc query formulation, burdening users to learn, and to recall precisely the query language and the database. Kaleidoscope avo...
Sang Kyun Cha, Gio Wiederhold