Results 81 to 90 of about 1,048 (100)

Integrated visual analytics workflow with GeoTime and nSpace VAST 2010 mini challenge 1 award: Outstanding Analysis and Accuracy

2010 IEEE Symposium on Visual Analytics Science and Technology, 2010
This paper is a case study focusing on the analytical process performed by three junior analysts using the nSpace/GeoTime tools to investigate arms dealing activities from various text records. Our integrated visual analytic applications created an environment that supported systematic use of analytical methods and helped junior analysts achieve the ...
Pascale Proulx, Adeel Khamisa, Rob Harper   +2 more
semanticscholar   +4 more sources

A relation between sparse and printable sets in NSPACE(log n)

Foundations of Computer Science: Potential - Theory - Cognition, 1997
For the polynomial time classes NPsparse and NPprint it is known that these classes coincide if and only if nondeterministic exponential time is closed under complement ([Ha Ye 84]). Transfering this result to logarithmic space classes would lead to an equality of sparse and printable sets in NSPACE(log n) if and only if nondeterministic space classes ...
Bernd Kirsig
semanticscholar   +4 more sources

Separation with the Ruzzo, Simon, and Tompa relativization implies Dspace(log n) ≠ Nspace(log n)

Information Processing Letters, 1987
Klaus-Jörn Lange, Bernd Kirsig
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Towards the Complexity of Petri Nets and One Counter Machines via Coordinated Table Selective Substitution Systems

Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2021
We investigate computational resources used by Turing machines (TMs) and alternating Turing machines (ATMs) to accept languages generated by coordinated table selective substitution systems with two components.
Liliana Cojocaru
semanticscholar   +1 more source

The complexity of solution sets to equations in hyperbolic groups

Israel Journal of Mathematics, 2020
We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, as shortlex geodesic words (or any regular set of quasigeodesic normal forms), is an EDT0L language whose specification can be computed in NSPACE(n2 log
L. Ciobanu, M. Elder
semanticscholar   +1 more source

The Sandbox for analysis: concepts and methods

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 2006
The Sandbox is a flexible and expressive thinking environment that supports both ad-hoc and more formal analytical tasks. It is the evidence marshalling and sense-making component for the analytical software environment called nSpace. This paper presents
W. Wright, David Schroh, Pascale Proulx, Alexander W. Skaburskis, B. Cort   +4 more
semanticscholar   +1 more source

Solutions sets to systems of equations in hyperbolic groups are EDT0L in PSPACE

International Colloquium on Automata, Languages and Programming, 2019
We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, with or without torsion, as shortlex geodesic words, is an EDT0L language whose specification can be computed in $\mathsf{NSPACE}(n^2\log n)$ for the ...
L. Ciobanu, M. Elder
semanticscholar   +1 more source

The Expressive Power of Uniform Population Protocols with Logarithmic Space

Symposium on Algorithmic Foundations of Dynamic Networks
Population protocols are a model of computation in which indistinguishable mobile agents interact in pairs to decide a property of their initial configuration. Originally introduced by Angluin et. al.
Philipp Czerner, Vincent Fischer, Roland Guttenberg   +2 more
semanticscholar   +1 more source

Back to space

New Yearbook for Phenomenology and Phenomenological Philosophy, 2019
Exercise 1 Warm up 1. What are the best inclusions you know of NL and NPSPACE, into deterministic classes? Prove them briey. 2. A unidirectional verier is a Turing machine with an additional input tape, which head never moves to the left (stay or right ...
Lilian Alweiss
semanticscholar   +1 more source

Random walks, universal traversal sequences, and the complexity of maze problems

20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979
R. Aleliunas, R. Karp, R. Lipton, L. Lovász, C. Rackoff   +4 more
semanticscholar   +1 more source