6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)

24-24 Sept. 1999

Filter Results

Displaying Results 1 - 25 of 47
  • 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (230 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s): 363
    Request permission for commercial reuse | PDF file iconPDF (15 KB)
    Freely Available from IEEE
  • String-oriented databases

    Publication Year: 1999, Page(s):158 - 167
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Relational databases and Datalog view each attribute as indivisible. This view, though useful in several applications, does not provide a suitable database paradigm for use in genetic, multimedia or scientific databases. Data in these applications are unstructured; querying on sub-strings of attribute values is often necessary. Moreover due to imprecision and incompleteness in the data, approximat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of term segmentation on Chinese/English cross-language information retrieval

    Publication Year: 1999, Page(s):149 - 157
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The majority of recent Cross-Language Information Retrieval (CLIR) research has focused on European languages. CLIR problems that involve East Asian languages such as Chinese introduce additional challenges, because written Chinese texts lack boundaries between terms. The paper examines three Chinese segmentation techniques in combination with two variants of dictionary-based Chinese to English qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching in metric spaces by spatial approximation

    Publication Year: 1999, Page(s):141 - 148
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    We propose a novel data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function defined among them, which satisfies the triangular inequality. The goal is, given a set of objects and a query, retrieve those objects close enough to the query. The number of distances computed to achieve this goal is the complexity measure. Our data structure,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • X-tract: structure extraction from botanical textual descriptions

    Publication Year: 1999, Page(s):2 - 7
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Most available information today, both from printed books and digital repositories, is in the form of free-format texts. The task of retrieving information from these ever-growing repositories has become a challenge for information retrieval (IR) researchers. In some fields, such as botany and taxonomy, textual descriptions observe a set of rules and use a relatively limited vocabulary. This makes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear time sorting of skewed distributions

    Publication Year: 1999, Page(s):135 - 140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    The article presents an efficient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows Zipf's distribution, and presents an example application where the algorithm is used to reduce the time to build word-based Huffman codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A groupware tool to support participatory business process reengineering

    Publication Year: 1999, Page(s):314 - 321
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    Companies normally hire external consultants to carry our their business process re-engineering. While this can be simple and low-cost, most reengineering projects with this approach have failed. A low level of workers' involvement with a consequent resistance to changes, and a continuous dependency on external consultants are the main drawbacks. We developed a tool based on an alternative approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and space-economical algorithm for calculating minimum redundancy prefix codes

    Publication Year: 1999, Page(s):128 - 134
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    The minimum redundancy prefix code problem is to determine, for a given list W=[w1,...,wn] of n positive symbol weights, a list L=[l1,...,ln] of n corresponding integer codeword lengths such that Σi=1n2 -li⩽1 and Σi=1nwil i is minimized. With the optimal list of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AllianceWeb: cooperative authoring on the WWW

    Publication Year: 1999, Page(s):286 - 295
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Currently, few applications provide support for collaborative work on the Web. This paper presents the way by which cooperative authoring can be easily and efficiently performed between authors distributed on the Web. The main goal is to provide support for allowing them to create common Web documents in a secure and consistent way. We present the AllianceWeb project whose goal is to extend the We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spaghettis: an array based algorithm for similarity queries in metric spaces

    Publication Year: 1999, Page(s):38 - 46
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    We present a new, pivot based data structure with dynamic capabilities to insert/delete both database elements and pivots. This feature is useful for applications where the database is not stationary, and the pivots must be changed from time to time. The spaghettis data structure can be thought of as a “flat” representation of a tree; but unlike it, a full representation of the distanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A customizable collaborative virtual environment on the Web

    Publication Year: 1999, Page(s):328 - 335
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Collaborative virtual environments (CVE) support the collaboration, communication and social interaction among users in virtual spaces. We present a customizable CVE implemented on top of the Web that allows for the creation of various interactive environments. This CVE is designed mainly, from the perspective of the desk, rooms and hall metaphors. The architecture of our CVE is based on design pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model and tool for semi-automatic recording of design rationale in software diagrams

    Publication Year: 1999, Page(s):306 - 313
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    The purpose of this work is to present an annotation model for recording design rationale, and to describe ABCDE-DR, a prototype system which implements this model, in particular for the domain of object diagrams in software engineering. It supports: semi-formal representation of DR; recording of design rationale in a semiautomatic manner through the reflection in action theory; and the integratio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds for parametric sequence comparison

    Publication Year: 1999, Page(s):55 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    We consider the problem of computing a global alignment between two or more sequences subject to varying mismatch and indel penalties. We prove a tight 3(n/2π)2/3+O(n1/3logn) bound on the worst-case number of distinct optimum alignments for two sequences of length n as the parameters are varied. This refines a O(n 2/3) upper bound by D. Gusfield et al. (1994). O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of awareness support in collaborative improvement of software processes

    Publication Year: 1999, Page(s):343 - 347
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    This paper discusses the possibilities for collaboration support in helping organizations to lessen social barriers to process improvement and to establish a process culture among developers. The paper explores this idea by proposing a collaborative environment that aims to promote software process improvement initiatives. The environment is focused on the role of awareness support, since we belie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences of different methods in the research and design of an “organisational memory” for process control

    Publication Year: 1999, Page(s):353 - 362
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    Dilemmas between practical longitudinal research and various design methodologies are discussed as they arose over 5 years in the context of developing a knowledge sharing tool (electronic diary) in industrial process control. Design methodology is often presented as a unitary framework, present from the start, and guiding choices, approaches to, and progress through subject matter. In practice, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-domain approximate string matching

    Publication Year: 1999, Page(s):120 - 127
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. We introduce a new formalism for a class of applications that takes two strings as input, each specified in terms of a particular domain, and performs a comparison motivated by constraints derived from a third, possibly different domain. This issue arises,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of groupware systems with the COPSE infrastructure

    Publication Year: 1999, Page(s):278 - 285
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    For a long time now, infrastructure technologies for the development of groupware applications have been proposed. However, the task of developing groupware is still complex, since it involves not only technical, but also social issues. As a consequence, current technologies represent limited solutions for supporting important aspects of cooperative work. Focused on what we consider essential issu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compact in-memory models for compression of large text databases

    Publication Year: 1999, Page(s):224 - 231
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    For compression of text databases, semi-static word based models are a pragmatic choice. Previous experiments have shown that, where there is not sufficient memory to store a full word based model, encoding rare words as sequences of characters can still allow good compression, while a pure character based model is poor. We propose a further kind of model that reduces main memory costs: approximat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient method for in memory construction of suffix arrays

    Publication Year: 1999, Page(s):81 - 88
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The suffix array is a string-indexing structure and a memory efficient alternative to the suffix tree. It has many advantages for text processing. We propose an efficient algorithm for sorting suffixes. We call this algorithm the two-stage suffix sort. One of our ideas is to exploit the specific relationships between adjacent suffixes. Our algorithm makes it possible to use the suffix array for mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near optimal multiple sequence alignments using a traveling salesman problem approach

    Publication Year: 1999, Page(s):105 - 114
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We present a new method for the calculation of multiple sequence alignments (MSAs). The input to our problem are n protein sequences. We assume that the sequences are related with each other and that there exists some unknown evolutionary tree that corresponds to the MSA. One advantage of our method is that the scoring can be done with reference to this phylogenetic tree, even though the tree stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An associative semantic model for text processing

    Publication Year: 1999, Page(s):31 - 37
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Natural language texts have an underlying structure that conveys an essential part of their information content. In order to better exploit text resources, this structure must be rendered explicit, which requires an automatic analysis based on local context and general world knowledge. The analysis must closely match the expectations of a typical reader. The paper presents a computational model th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PAWS: towards a participatory approach to business process reengineering

    Publication Year: 1999, Page(s):262 - 268
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    Companies normally hire external consultants to carry out their business process re-engineering. While this can be simple and efficient in the short term, it may not be convenient in the mid and long term. A low level of workers' involvement with a consequent resistance to changes, and a continuous dependency on external consultancy are the main drawbacks. We propose an alternative approach to BPR... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The EC query language applied to old manuscripts

    Publication Year: 1999, Page(s):206 - 214
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We show the possibilities of the EC query language in a very structured environment as a catalog of old manuscripts. The EC language can deal with simple queries and with more complex ones, as approximate searches. We have done two classes of experiments. The first one shows that the structure does not change the statistical behaviour of the system with regard to the frequency of the words. The se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contextual array splicing systems

    Publication Year: 1999, Page(s):168 - 175
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    The concept of splicing is extended to arrays. A new method of splicing called Contextual Array Splicing is introduced which produces imperfect molecules throughout the structure. This model is capable of generating interesting patterns. We prove that if an array language is p-column strictly locally testable, then all arrays of column size p are constants. The concept of Mixed Splicing is also in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.