Sciweavers

    DMIN
    2007
    90views Data Mining» more  DMIN 2007»
    On Minimal Infrequent Itemset Mining
    13 years 11 months ago
    On Minimal Infrequent Itemset Mining
    Download  mavdisk.mnsu.edu
    —A new algorithm for minimal infrequent itemset mining is presented. Potential applications of finding infrequent itemsets include statistical disclosure risk assessment, bioinf...
    David J. Haglin, Anna M. Manning
    claim paper
    Read More »
    DMIN
    2007
    85views Data Mining» more  DMIN 2007»
    A Clustering Approach for Achieving Data Privacy
    13 years 11 months ago
    A Clustering Approach for Achieving Data Privacy
    Download  www.nku.edu
    Abstract — New privacy regulations together with everincreasing data availability and computational power have created a huge interest in data privacy research. One major researc...
    Alina Campan, Traian Marius Truta, John Miller, Ra...
    claim paper
    Read More »
    CSC
    2008
    101views Applied Computing» more  CSC 2008»
    Efficient and Effective Practical Algorithms for the Set-Covering Problem
    13 years 11 months ago
    Efficient and Effective Practical Algorithms for the Set-Covering Problem
    Download  www.uwplatt.edu
    - The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
    Qi Yang, Jamie McPeek, Adam Nofsinger
    claim paper
    Read More »
    CSC
    2008
    124views Applied Computing» more  CSC 2008»
    An Algorithm for Solving Scaled Total Least Squares Problems
    13 years 11 months ago
    An Algorithm for Solving Scaled Total Least Squares Problems
    Download  www.cas.mcmaster.ca
    Abstract - In this paper, we present a rankrevealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis of the algorithm is given. Our numeri...
    Sanzheng Qiao, Wei Xu, Yimin Wei
    claim paper
    Read More »
    COMAD
    2008
    125views Knowledge Management» more  COMAD 2008»
    Efficient Evaluation of Forward XPath Axes over XML Streams
    13 years 11 months ago
    Efficient Evaluation of Forward XPath Axes over XML Streams
    Download  www.cse.iitb.ac.in
    Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
    Abdul Nizar, P. Sreenivasa Kumar
    claim paper
    Read More »
    COLING
    2008
    110views Computational Linguistics» more  COLING 2008»
    Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
    13 years 11 months ago
    Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
    Download  www.cs.huji.ac.il
    We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
    Roi Reichart, Ari Rappoport
    claim paper
    Read More »
    COLING
    2008
    140views Computational Linguistics» more  COLING 2008»
    Generation of Referring Expressions: Managing Structural Ambiguities
    13 years 11 months ago
    Generation of Referring Expressions: Managing Structural Ambiguities
    Download  www.csd.abdn.ac.uk
    Existing algorithms for the Generation of Referring Expressions tend to generate distinguishing descriptions at the semantic level, disregarding the ways in which surface issues c...
    Imtiaz Hussain Khan, Kees van Deemter, Graeme Ritc...
    claim paper
    Read More »
    CIMAGING
    2008
    172views Hardware» more  CIMAGING 2008»
    Blind reconstruction of sparse images with unknown point spread function
    13 years 11 months ago
    Blind reconstruction of sparse images with unknown point spread function
    Download  www.eecs.umich.edu
    We consider the image reconstruction problem when the original image is assumed to be sparse and when partial knowledge of the point spread function (PSF) is available. In particu...
    Kyle Herrity, Raviv Raich, Alfred O. Hero III
    claim paper
    Read More »
    CDES
    2008
    123views Hardware» more  CDES 2008»
    R-tree: A Hardware Implementation
    13 years 11 months ago
    R-tree: A Hardware Implementation
    Download  www.ece.iupui.edu
    R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
    Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
    claim paper
    Read More »
    CCCG
    2008
    85views Computational Geometry» more  CCCG 2008»
    Recognition of Largest Empty Orthoconvex Polygon in a Point Set
    13 years 11 months ago
    Recognition of Largest Empty Orthoconvex Polygon in a Point Set
    Download  cccg.ca
    An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
    Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab...
    claim paper
    Read More »
    « first‹ previous…150151152153154155156157158…next ›last »
    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.