4074 search results - page 140 / 815 » Defining Computational Aesthetics |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
DCC
2007
IEEE
14 years 10 months ago
2007
IEEE
We define a mixed partition of = PG(d, qr) to be a partition of the points of into subspaces of two distinct types, for instance, a partition of PG(2n - 1, q2) into (n - 1)-spac...
DCC
2007
IEEE
14 years 10 months ago
2007
IEEE
We explore the Full Compressed Delta Encoding problem in compressed texts, defined as the problem of constructing a delta file directly from the two given compressed files, withou...
ICNS
2008
IEEE
14 years 4 months ago
2008
IEEE
The paper presents an analysis of the possibilities of defining penalty functions to be used in SLA management frameworks. As a basis for the analysis, a brief survey of metrics u...
ISSADS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. . Steganography is defined as the art and science of hiding information, it takes one piece of information and hides it within another. The piece more used to hide inform...