Sciweavers

    806 search results - page 51 / 162
    » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
    Sort
    View
    SIGMOD
    2012
    ACM
    203views Database» more  SIGMOD 2012»
    Optimizing index for taxonomy keyword search
    11 years 11 months ago
    Optimizing index for taxonomy keyword search
    Download  www.cs.uiuc.edu
    Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
    Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
    claim paper
    Read More »
    WWW
    2006
    ACM
    174views Internet Technology» more  WWW 2006»
    Optimizing scoring functions and indexes for proximity search in type-annotated corpora
    14 years 9 months ago
    Optimizing scoring functions and indexes for proximity search in type-annotated corpora
    Download  www.cse.iitb.ac.in
    We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
    Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
    claim paper
    Read More »
    AOSD
    2007
    ACM
    117views Software Engineering» more  AOSD 2007»
    Performance improvement for persistent systems by AOP
    14 years 23 days ago
    Performance improvement for persistent systems by AOP
    Download  www.csg.is.titech.ac.jp
    Efficient data retrieval from databases is a significant issue of the design of persistent systems. We propose an aspect oriented persistent system named AspectualStore. Aspectual...
    Yasuhiro Aoki, Shigeru Chiba
    claim paper
    Read More »
    DATESO
    2009
    101views Database» more  DATESO 2009»
    Using Top Trees For Easy Programming of Tree Algorithms
    13 years 6 months ago
    Using Top Trees For Easy Programming of Tree Algorithms
    Download  sunsite.informatik.rwth-aachen.de
    Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
    Michal Vajbar
    claim paper
    Read More »
    AAAI
    2008
    117views Intelligent Agents» more  AAAI 2008»
    Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
    13 years 11 months ago
    Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
    Download  www.tkl.iis.u-tokyo.ac.jp
    Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
    Zhenglu Yang, Lin Li, Masaru Kitsuregawa
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.