Search (7 results, page 1 of 1)

0.006249511 = product of:
  0.07499413 = sum of:
    0.07499413 = weight(_text_:informatik in 5639) [ClassicSimilarity], result of:
      0.07499413 = score(doc=5639,freq=2.0), product of:
        0.1662844 = queryWeight, product of:
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.032588977 = queryNorm
        0.4509992 = fieldWeight in 5639, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.0625 = fieldNorm(doc=5639)
  0.083333336 = coord(1/12)

Imprint

Koblenz, Landau : Universität Koblenz-Landau, FB Informatik

0.0039059445 = product of:
  0.046871334 = sum of:
    0.046871334 = weight(_text_:informatik in 3222) [ClassicSimilarity], result of:
      0.046871334 = score(doc=3222,freq=2.0), product of:
        0.1662844 = queryWeight, product of:
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.032588977 = queryNorm
        0.2818745 = fieldWeight in 3222, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3222)
  0.083333336 = coord(1/12)

Imprint

Mannheim : Fakultät für Mathematik und Informatik

0.0031247556 = product of:
  0.037497066 = sum of:
    0.037497066 = weight(_text_:informatik in 5002) [ClassicSimilarity], result of:
      0.037497066 = score(doc=5002,freq=2.0), product of:
        0.1662844 = queryWeight, product of:
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.032588977 = queryNorm
        0.2254996 = fieldWeight in 5002, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.03125 = fieldNorm(doc=5002)
  0.083333336 = coord(1/12)

Imprint

Darmstadt : Fachbereich Informatik der Technischen Universität Darmstadt

0.0031247556 = product of:
  0.037497066 = sum of:
    0.037497066 = weight(_text_:informatik in 3402) [ClassicSimilarity], result of:
      0.037497066 = score(doc=3402,freq=2.0), product of:
        0.1662844 = queryWeight, product of:
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.032588977 = queryNorm
        0.2254996 = fieldWeight in 3402, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.03125 = fieldNorm(doc=3402)
  0.083333336 = coord(1/12)

Content

Dissertation zur Erlangung des akademischen Grades des Doktors der Naturwissenschaften (Dr. rer. nat.) an der Universität Konstanz Mathematisch-naturwissenschaftliche Sektion Fachbereich Informatik und Informationswissenschaft Fach Informationswissenschaft; vgl. unter: http://www.ub.uni-konstanz.de/kops/volltexte/2006/1925/

0.001839732 = product of:
  0.022076784 = sum of:
    0.022076784 = product of:
      0.044153567 = sum of:
        0.044153567 = weight(_text_:22 in 3406) [ClassicSimilarity], result of:
          0.044153567 = score(doc=3406,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.38690117 = fieldWeight in 3406, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=3406)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

30. 5.2010 16:22:35

0.0011038391 = product of:
  0.01324607 = sum of:
    0.01324607 = product of:
      0.02649214 = sum of:
        0.02649214 = weight(_text_:22 in 1709) [ClassicSimilarity], result of:
          0.02649214 = score(doc=1709,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.23214069 = fieldWeight in 1709, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=1709)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

4. 2.2015 9:22:39

0.0010460628 = product of:
  0.012552753 = sum of:
    0.012552753 = weight(_text_:internet in 4746) [ClassicSimilarity], result of:
      0.012552753 = score(doc=4746,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1304718 = fieldWeight in 4746, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03125 = fieldNorm(doc=4746)
  0.083333336 = coord(1/12)

Abstract

Many real-world domains can be represented as large node-link graphs: backbone Internet routers connect with 70,000 other hosts, mid-sized Web servers handle between 20,000 and 200,000 hyperlinked documents, and dictionaries contain millions of words defined in terms of each other. Computational manipulation of such large graphs is common, but previous tools for graph visualization have been limited to datasets of a few thousand nodes. Visual depictions of graphs and networks are external representations that exploit human visual processing to reduce the cognitive load of many tasks that require understanding of global or local structure. We assert that the two key advantages of computer-based systems for information visualization over traditional paper-based visual exposition are interactivity and scalability. We also argue that designing visualization software by taking the characteristics of a target user's task domain into account leads to systems that are more effective and scale to larger datasets than previous work. This thesis contains a detailed analysis of three specialized systems for the interactive exploration of large graphs, relating the intended tasks to the spatial layout and visual encoding choices. We present two novel algorithms for specialized layout and drawing that use quite different visual metaphors. The H3 system for visualizing the hyperlink structures of web sites scales to datasets of over 100,000 nodes by using a carefully chosen spanning tree as the layout backbone, 3D hyperbolic geometry for a Focus+Context view, and provides a fluid interactive experience through guaranteed frame rate drawing. The Constellation system features a highly specialized 2D layout intended to spatially encode domain-specific information for computational linguists checking the plausibility of a large semantic network created from dictionaries. The Planet Multicast system for displaying the tunnel topology of the Internet's multicast backbone provides a literal 3D geographic layout of arcs on a globe to help MBone maintainers find misconfigured long-distance tunnels. Each of these three systems provides a very different view of the graph structure, and we evaluate their efficacy for the intended task. We generalize these findings in our analysis of the importance of interactivity and specialization for graph visualization systems that are effective and scalable.