Sciweavers

4074 search results - page 69 / 815
» Defining Computational Aesthetics
Sort
View
CCCG
2010
13 years 9 months ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...
BSL
2008
97views more  BSL 2008»
13 years 7 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
JUCS
2008
122views more  JUCS 2008»
13 years 7 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
WM
2003
13 years 9 months ago
Worlds, Models, and KM
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
Cyrus F. Nourani
DCC
2005
IEEE
14 years 7 months ago
Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve
We consider the quotient of the Hermitian curve defined by the
Gretchen L. Matthews