By Topic

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
  • The ADT proximity and text proximity problems

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

    Practical text proximity problems lead to the abstract data type proximity that handles close points in the plane. Different variants and implementations of proximity are proposed and tight-complexity bounds based on information theory are derived. This problem is related to evaluating Boolean queries in large text retrieval (as in Web search engines) and to the “Sorting X+Y” problem 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.
  • Problems related to subsequences and supersequences

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

    We present an algorithm for building the automaton that searches for all non-overlapping occurrences of each subsequence from the set of subsequences. Further, we define Directed Acyclic Supersequence Graph and use it to solve the generalized Shortest Common Supersequence problem, the Longest Common Non-Supersequence problem, and the Longest Consistent Supersequence problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast algorithm on average for all-against-all sequence matching

    Publication Year: 1999, Page(s):16 - 23
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    We present an algorithm which attempts to align pairs of subsequences from a database of genetic sequences. The algorithm simulates the classical dynamic programming alignment algorithm over a suffix array of the database. We provide a detailed average case analysis which shows that the running time of the algorithm is subquadratic with respect to the database size. A similar algorithm solves the ... 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.
  • Concurrency and recovery in full-text indexing

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

    An important feature of a document database system is that the documents can be retrieved by searching for words from their contents. In a full-text index, each word of the stored documents can be used as a search key. Inserting a new document into the database automatically triggers a transaction that inserts the words together with their occurrence information into the index. We present solution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient uniform-cost normalized edit distance algorithm

    Publication Year: 1999, Page(s):8 - 15
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m⩾n, is to transform X into Y through a sequence of three types of edit operations: insertion, deletion, and substitution. The model assumes a given cost function which assigns a non-negative real weight to each edit operation. The amortized weight for a given edit sequence is the ratio of ... 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.
  • 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.
  • CoBWeb-a crawler for the Brazilian Web

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

    One of the key components of current Web search engines is the document collector. The paper describes CoBWeb, an automatic document collector whose architecture is distributed and highly scalable. CoBWeb aims at collecting large amounts of documents per time period while observing operational and ethical limits in the crawling process. CoBWeb is part of the SIAM (Information Systems in Mobile Com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Emotional awareness in collaborative systems

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

    Emotions play an important role in human interaction. Both, our own emotional state and our perception of that of others with which we collaborate influence the outcome of cooperative work. With the growing interest in providing computational support for the recognition and representation of emotions, there is a clear interest in adding such facilities to groupware systems and to evaluate the posi... 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.
  • Design patterns for collaborative systems

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

    Collaborative applications provide a group of users with the facility to communicate and share data in a coordinated way. We propose a pattern system to design the basic aspects of data sharing, communication and coordination for collaborative applications. These patterns are useful for the design and development of collaborative applications as well as for the development of platforms for the con... 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.
  • A method of describing document contents through topic selection

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

    Given a large hierarchical dictionary of concepts, the task of selection of the concepts that describe the contents of a given document is considered. The problem consists in proper handling of the top-level concepts in the hierarchy. As a representation of the document, a histogram of the topics with their respective contribution in the document is used. The contribution is determined by comparis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical constructions of L-restricted alphabetic prefix codes

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

    Information retrieval systems use various search techniques such as B-trees, inverted files and suffix arrays to provide quick response. Many of these techniques rely on string comparison operations. If a record field is coded using Huffman codes (D.A. Huffman, 1952) in order to save storage space, the field must be decoded before performing any comparison. On the other hand, if the field is alpha... 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 (11)
    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.
  • 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.
  • Top-down extraction of semi-structured data

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

    We propose an innovative approach to extracting semi-structured data from Web sources. The idea is to collect a couple of example objects from the user and to use this information to extract new objects from new pages or texts. We propose a top-down strategy that extracts complex objects, decomposing them in objects less complex, until atomic objects have been extracted. Through experimentation, w... 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.
  • 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.
  • PAWS: towards a participatory approach to business process reengineering

    Publication Year: 1999, Page(s):262 - 268
    Cited by:  Papers (8)
    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.
  • Developing a tool to assist electronic facilitation of decision-making groups

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

    One resource playing a critical role in electronically supported decision making groups is the facilitator. Facilitation is a complex task, encompassing social abilities, pre-meeting planning of decision making processes and supervising the technology usage during meetings. We found two problems with previous support to electronic facilitation: (1) limited support to planning activities; and (2) l... View full abstract»

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