Sciweavers

3172 search results - page 92 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
JCSS
2011
107views more  JCSS 2011»
15 years 1 months ago
The isomorphism conjecture for constant depth reductions
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
Manindra Agrawal
NDJFL
2010
15 years 1 months ago
Decidability and Computability of Certain Torsion-Free Abelian Groups
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
IRI
2007
IEEE
16 years 20 days ago
MAGIC: A Multi-Activity Graph Index for Activity Detection
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
Massimiliano Albanese, Andrea Pugliese, V. S. Subr...
PRESENCE
2002
119views more  PRESENCE 2002»
15 years 6 months ago
Visual Homing Is Possible Without Landmarks: A Path Integration Study in Virtual Reality
The literature often suggests that proprioceptive and especially vestibular cues are required for navigation and spatial orientation tasks involving rotations of the observer. To ...
Bernhard E. Riecke, Henricus A. H. C. van Veen, He...
ICWE
2009
Springer
16 years 28 days ago
UWE4JSF: A Model-Driven Generation Approach for Web Applications
Model-driven engineering is a promising approach, but there are still many hurdles to overcome. The tool UWE4JSF solves the hurdles for the model-driven development of web applicat...
Christian Kroiss, Nora Koch, Alexander Knapp