Sciweavers

2907 search results - page 116 / 582
» Presentations of Structures in Admissible Sets
Sort
View
108
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
A simple and efficient kinetic spanner
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
Mohammad Ali Abam, Mark de Berg, Joachim Gudmundss...
ALGORITHMICA
2006
96views more  ALGORITHMICA 2006»
15 years 25 days ago
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
Marcus Brazil, D. A. Thomas, J. F. Weng, Martin Za...
95
Voted
ACS
2010
15 years 27 days ago
Lawvere Completion and Separation Via Closure
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
Dirk Hofmann, Walter Tholen
110
Voted
JSYML
2000
56views more  JSYML 2000»
15 years 17 days ago
Recursive in A Generic Real
There is a comeager set C contained in the set of 1-generic reals and a first order structure M such that for any real number X, there is an element of C which is recursive in X if...
Juichi Shinoda, Theodore A. Slaman
69
Voted
CORR
2010
Springer
44views Education» more  CORR 2010»
14 years 11 months ago
Combinatorial substitutions and sofic tilings
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings ar...
Thomas Fernique, Nicolas Ollinger