Sciweavers

10447 search results - page 303 / 2090
» The Philosophy of Computer Science
Sort
View
CCA
2009
Springer
15 years 10 months ago
On the Computability of Rectifiable Simple Curve (Extended Abstract)
d Abstract) Robert Rettinger1 and Xizhong Zheng2,3 1 Lehrgebiet Algorithmen und Komplexit
Robert Rettinger, Xizhong Zheng
CSE
2009
IEEE
16 years 1 months ago
Community Computing: Comparisons between Rural and Urban Societies Using Mobile Phone Data
Abstract—We present a comparative analysis of the behavioral dynamics of rural and urban societies using four years
Nathan Eagle, Yves-Alexandre de Montjoye, Lu&iacut...
SOFSEM
2000
Springer
15 years 10 months ago
Computing the Dimension of Linear Subspaces
Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau
Martin Ziegler, Vasco Brattka
214
Voted

Lecture Notes
476views
17 years 5 months ago
Algebra and Computation
These are the lecture notes by Madhu Sudan on the course Algebra and Computation, offered in MIT in 1999.
Madhu Sudan
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek