Sciweavers

60 search results - page 1 / 12
» Small Spans in Scaled Dimension
Sort
View
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
13 years 8 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
MFCS
2004
Springer
13 years 10 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
FCT
2005
Springer
13 years 10 months ago
Generic Density and Small Span Theorem
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
Philippe Moser
HAPTICS
2005
IEEE
13 years 10 months ago
Spanning Large Workspaces Using Small Haptic Devices
Exploring large virtual environments using a small haptic device with limited-workspace capabilities is a challenging task because the user very quickly reaches the borders of the...
François Conti, Oussama Khatib
ICPADS
2005
IEEE
13 years 10 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan