8695 search results - page 347 / 1739 » Making the Complex Simple |
192
click to vote
CJ
2006
15 years 6 months ago
2006
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
187
click to vote
COR
2006
15 years 6 months ago
2006
Peg Solitaire is a well known puzzle which can prove difficult despite its simple rules. Pegs are arranged on a board such that at least one `hole' remains. By making draught...
139
click to vote
ENDM
2006
15 years 6 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
201
click to vote
IVC
2008
15 years 6 months ago
2008
In this work, we propose an original method of resolution of the shape from shading problem, which is accurate and converges with a few iterations. It relies on two simple ideas. ...
160
click to vote
JAPLL
2008
15 years 6 months ago
2008
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...