4372 search results - page 358 / 875 » Algorithmic Theories of Everything |
192
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
134
click to vote
CACM
2004
15 years 6 months ago
2004
s (theory, abstraction, and design) [2]. They put programming as a subpart of the design component of most of the nine areas, especially algorithms and software engineering. Their ...
109
click to vote
RSA
1998
15 years 6 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
145
click to vote
TCS
2002
15 years 6 months ago
2002
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
191
click to vote
TMM
2002
15 years 6 months ago
2002
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...