108 search results - page 11 / 22 » Computational Discovery in Pure Mathematics |
149
Voted
SAC
2009
ACM
16 years 15 days ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
186
click to vote
SIGSOFT
2010
ACM
15 years 3 months ago
2010
ACM
Since software is developed to run on computers, there is a tendency to focus computer science and software engineering on how best to get software to run on computers. But, engin...
157
click to vote
ACMSE
2006
ACM
15 years 11 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
147
click to vote
CCA
2009
Springer
16 years 8 days ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
151
click to vote
EDBT
2000
ACM
15 years 9 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...