Search (5 results, page 1 of 1)

  • × author_ss:"Plaisant, C."
  1. Harris, C.; Allen, R.B.; Plaisant, C.; Shneiderman, B.: Temporal visualization for legal case histories : from interpersonal communication to online information process (1999) 0.00 
    0.003754243 = product of:
  0.011262729 = sum of:
    0.011262729 = weight(_text_:a in 6715) [ClassicSimilarity], result of:
      0.011262729 = score(doc=6715,freq=16.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.2161963 = fieldWeight in 6715, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=6715)
  0.33333334 = coord(1/3)
    Abstract
    This paper discusses visualization of legal information using a tool for temporal information called LifeLines. The direct and indirect histories of cases can become very complex. We explored ways that LifeLines could aid in viewing the links between the original case and the direct and indirect histories. The Apple Computer, Inc. v. Microsoft Corporation and Hewlett Packard Company case is used to illustrate the prototype. For example, if users want to find out how the rulings or statutes changed throughout this case, they could retrieve this information within a single display. Using the timeline, users could also choose at which point in time they would like to begin viewing the case. LifeLines support various views of a case's history. For instance, users can view the trial history of a case, the references involved in a case, and citations made to a case. The paper describes improvements to LifeLines that could help in providing a more
    Type
    a
  2. Furuta, R.; Plaisant, C.; Shneiderman, B.: Automatically transforming regularly structured linear documents into hypertext (1989) 0.00 
    0.0035395343 = product of:
  0.010618603 = sum of:
    0.010618603 = weight(_text_:a in 7501) [ClassicSimilarity], result of:
      0.010618603 = score(doc=7501,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.20383182 = fieldWeight in 7501, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.125 = fieldNorm(doc=7501)
  0.33333334 = coord(1/3)
    Type
    a
  3. Faloutsos, C.; Shneiderman, B.; Lee, R.; Plaisant, C.: Incorporating string search in a hypertext system : user interface and signature file design issues (1990) 0.00 
    0.003462655 = product of:
  0.010387965 = sum of:
    0.010387965 = weight(_text_:a in 2758) [ClassicSimilarity], result of:
      0.010387965 = score(doc=2758,freq=10.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.19940455 = fieldWeight in 2758, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2758)
  0.33333334 = coord(1/3)
    Abstract
    Hypertext systems provide an appealing mechanism for informally browsing databases by traversing selectable links. However, in many fact finding situations string searching is an effective complement to browsing. Describes the application of the signature file method to achieve rapid and convenient strung search in small personal computer hypertext environments. The method has been implemented to a prototype, as well as in a commercial product. Presents performance data for search times and storage space from a commercial hypertext database and discusses user interface issues. Experience with the string search interface indicates that it was used successfully by novice users
    Type
    a
  4. Kumar, H.P.; Plaisant, C.; Shneiderman, B.: Browsing hierarchical data with multi-level dynamic queries and pruning (1997) 0.00 
    0.00296799 = product of:
  0.00890397 = sum of:
    0.00890397 = weight(_text_:a in 750) [ClassicSimilarity], result of:
      0.00890397 = score(doc=750,freq=10.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.1709182 = fieldWeight in 750, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=750)
  0.33333334 = coord(1/3)
    Abstract
    The PDQ Tree-browser (Pruning with Dynamic Queries) visualization tool was specified, designed and developed for browsing hierarchies with a large number of nodes. It presents trees in 2 tightly coupled views, one a detailed view and the other an overview. Users can use dynamic queries, a method for rapidly filtering data, to filter nodes at each level of the tree. The dynamic query panels are user-customisable. Sub-trees of unselected nodes are pruned out, leading to compact views of the relevant nodes. Usability testing of the PDQ Tree-browser, done with 8 subjects, helped assess strengths and identify possible improvements. It was used in Network Management (600 nodes) and UniversityFinder (1100 nodes) applications. A controlled experiment, with 24 subjects, showed that pruning significantly improved performance speed and subject user satisfaction
    Type
    a
  5. Kang, H.; Plaisant, C.; Elsayed, T.; Oard, D.W.: Making sense of archived e-mail : exploring the Enron collection with NetLens (2010) 0.00 
    0.0022989952 = product of:
  0.006896985 = sum of:
    0.006896985 = weight(_text_:a in 3446) [ClassicSimilarity], result of:
      0.006896985 = score(doc=3446,freq=6.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.13239266 = fieldWeight in 3446, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=3446)
  0.33333334 = coord(1/3)
    Abstract
    Informal communications media pose new challenges for information-systems design, but the nature of informal interaction offers new opportunities as well. This paper describes NetLens-E-mail, a system designed to support exploration of the content-actor network in large e-mail collections. Unique features of NetLens-E-mail include close coupling of orientation, specification, restriction, and expansion, and introduction and incorporation of a novel capability for iterative projection between content and actor networks within the same collection. Scenarios are presented to illustrate the intended employment of NetLens-E-mail, and design walkthroughs with two domain experts provide an initial basis for assessment of the suitability of the design by scholars and analysts.
    Type
    a

Authors

Years

Themes