Documentos: Recent submissions

  • Berrani Sid-Ahmed; Amsaleg Laurent; Gros Patrick (2003)
    It is known that all multi-dimensional index structures fail to accelerate content-based similarity searches when the feature vectors describing images are high-dimensional. It is possible to circumvent this problem by ...
  • Chen Chung-Min; Cheng Christine T (2003)
    Aside from enhancing data availability during disk failures, replication of data is also used to speed up I/O performance of read-intensive applications. There are two issues that need to be addressed: (a) data placement ...
  • Services End User Computing (2003)
    In this paper, we discuss the use of ontologies for semantic interoperability and integration. We argue that information technology has evolved into a world of largely loosely coupled systems and as such, needs increasingly ...
  • Tang Chun; Zhang Aidong (2003)
    DNA microarray technology is now widely used in basic biomed-ical research for mRNA expression profiling and are increasingly being used to explore patterns of gene expression in clinical research. Automatically detecting ...
  • Jiang Qingchun; Chakravarthy Sharma (2003)
    Currently, stream data processing is an active area of research , which includes everything from algorithms and ar-chitectures for stream processing to modelling, and analysis of various components of a stream processing ...
  • Boucelma Omar; Garinet Jean-Yves; Lacroix Zó E (2003)
    The proliferation of spatial data on the Internet is beginning to allow a much wider access to data currently available in various Geographic Information Systems (GIS). In order to provide effective spatial database ...
  • Smith Kenneth; Swarup Vipin; Jajodia Sushil; Faatz Donald; Cornett Todd; Hoyt Jeff (2003)
    Shared scientific data, such as neuroimagery, offers great benefits to science. However, data owners must exercise custodial responsibilities which can conflict with the unhindered sharing of their data. Given simple choices ...
  • Lin Jimmy; Katz Boris (2003)
    We present a strategy for answering fact-based natural language questions that is guided by a characterization of real-world user queries. Our approach, implemented in a system called Aranea, extracts answers from the Web ...
  • He Qi; Wang Tok; Ling (2004)
    We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems. A major challenge is when component database schemas are schematic discrepant from each other, i.e., data ...
  • Fan Wenfei; Garofalakis Minos; Xiong Ming; Jia Xibei (2004)
    The proliferation of XML as a standard for data representation and exchange in diverse, next-generation Web applications has created an emphatic need for effective XML data-integration tools. For several real-life scenarios, ...
  • Knabe Frederick; Tunkelang Daniel (2004)
    Endeca's approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using a master–slave architecture, we are able to ...
  • Yang Beverly; Fontoura Marcus; Shekita Eugene; Rajagopalan Sridhar; Beyer Kevin (2004)
    ËØÖÙÙØÙÖÖÐ ÓÓÒ× ÖÖ ÙÒÒÒÑÑÒØØÐ ÓÔÖÖØØÓÒ Ò ÅÄ ÕÙÙÖÝ ÔÖÓ¹ ×××ÒÒ ÒÒ ÐÐÖÖÖ ÓÝ Ó ÛÓÖÖ × ÓÙ××× ÓÒ ÒÒÒܹ¹¹××× Ð¹ ÓÖÖØØÑ× ÓÖ ÜÜÜÙØØÒÒ ØØØÑº ÁÒ ØØØ× ÔÔÔÖ¸ÛÔÔÔÖ¸Û ××ÖÖÖ ÓÛ Ø ÛÓ ÛÐй¹ÒÓÛÒ ÒÒÒÜ ØÙÖÖ× ß ÔÔØØ ÒÒÒÒÒ× ÒÒ ÒÒÒרÓÖ ÒÒÓÖÑѹ ...
  • Wu Kun-Lung; Chen Shyh-Kwei; Yu Philip S (2004)
    A large number of continual range queries can be issued against a data stream. Usually, a main memory-based query index with a small storage cost and a fast search time is needed, especially if the stream is rapid. In this ...
  • Wang Ke; Xu Yabo; Xu Jeffrey; Yu (2004)
    Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., " don't care ") of arbitrary size. Mining frequent patterns in such sequences faces a different type of explosion than in ...
  • Ding Luping; Rundensteiner Elke A (2004)
    We explore join optimizations in the presence of both time-based constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named PWJoin that exploits such combined constraints ...
  • Lu Jiaheng; Chen Ting; Wang Tok; Ling (2004)
    With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database. A number of algorithms have been proposed ...
  • Gollapudi Sreenivas; Sivakumar D (2004)
    Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In this paper, we propose a framework based on ...
  • Pisharath Jayaprakash; Choudhary Alok; Kandemir Mahmut (2004)
    With the tremendous growth of system memories, memory-resident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing data in multiple chips, with each chip ...
  • He Bin; Tao Tao; Kevin Chen-Chuan; Chang (2004)
    In the recent years, the Web has been rapidly " deepened " with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query interfaces and results. Organizing such ...
  • Zhao Qiankun; Sourav †; Bhowmick S; Mohania Mukesh; Kambayashi Yahiko; Cais § † (2004)
    Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic in real applications. To the best of our ...

Search DSpace


Browse

My Account