Sciweavers

9405 search results - page 87 / 1881
» Computing a Model of Set Theory
Sort
View
ICPR
2006
IEEE
15 years 11 months ago
Matching 2D Shapes using their Symmetry Sets
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter...
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
15 years 10 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
CORR
2004
Springer
90views Education» more  CORR 2004»
14 years 9 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
CSCW
2012
ACM
13 years 5 months ago
Organizing without formal organization: group identification, goal setting and social modeling in directing online production
A challenge for many online production communities is to direct their members to accomplish tasks that are important to the group, even when these tasks may not match individual m...
Haiyi Zhu, Robert Kraut, Aniket Kittur
BIRTHDAY
2006
Springer
15 years 1 months ago
Uniform Functors on Sets
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...
Lawrence S. Moss