1092 search results - page 101 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
195
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
141
click to vote
IPPS
2008
IEEE
16 years 14 days ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
135
click to vote
TACAS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
172
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
This paper describes a system for simulating the evolution of artificial 2D plant morphologies. Virtual plant genotypes are inspired by the mathematical formalism known as Lindenma...