1686 search results - page 118 / 338 » Programs as polygraphs: computability and complexity |
133
Voted
NIPS
1993
15 years 4 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
183
click to vote
ECBS
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper, it is shown that, through the use of Model-Integrated Program Synthesis MIPS, parallel real-time implementations of image processing data ows can be synthesized fro...
131
Voted
IJCAI
2003
15 years 4 months ago
2003
An interpretation system finds the likely mappings from portions of an image to real-world objects. An interpretation policy specifies when to apply which imaging operator, to whi...
125
Voted
ISIPTA
2003
IEEE
15 years 8 months ago
2003
IEEE
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
121
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...