Sciweavers

5019 search results - page 57 / 1004
» On the Reflexivity of Point Sets
Sort
View
IJBC
2002
71views more  IJBC 2002»
15 years 6 months ago
Rotation Sets for orbits of Degree One Circle Maps
Let F be the lifting of a circle map of degree one. In [?] a notion of F-rotation interval of a point x S1 was given. In this paper we define and study a new notion of a rotation ...
Lluís Alsedà, Francesc Mañosa...
RSA
2008
63views more  RSA 2008»
15 years 5 months ago
On the size of the algebraic difference of two random Cantor sets
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
Michel Dekking, Károly Simon
STACS
2009
Springer
15 years 11 months ago
An Order on Sets of Tilings Corresponding to an Order on Languages
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...
Nathalie Aubrun, Mathieu Sablik
ESOP
2000
Springer
15 years 10 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 10 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...