Sciweavers

    2286 search results - page 91 / 458
    » Algorithms for Categorical Equivalence
    Sort
    View
    ISAAC
    2003
    Springer
    104views Algorithms» more  ISAAC 2003»
    Deterministic Algorithm for the t-Threshold Set Problem
    15 years 3 months ago
    Deterministic Algorithm for the t-Threshold Set Problem
    Download  www.cs.uwaterloo.ca
    Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
    Jérémy Barbay, Claire Kenyon
    claim paper
    Read More »
    ACL
    2006
    116views Computational Linguistics» more  ACL 2006»
    An Improved Redundancy Elimination Algorithm for Underspecified Representations
    14 years 11 months ago
    An Improved Redundancy Elimination Algorithm for Underspecified Representations
    Download  www.coli.uni-saarland.de
    We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
    Alexander Koller, Stefan Thater
    claim paper
    Read More »
    DAM
    2006
    79views more  DAM 2006»
    A simple expected running time analysis for randomized "divide and conquer" algorithms
    14 years 10 months ago
    A simple expected running time analysis for randomized "divide and conquer" algorithms
    Download  www.cs.clemson.edu
    There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
    Brian C. Dean
    claim paper
    Read More »
    IPL
    2007
    95views more  IPL 2007»
    Optimal implementations of UPGMA and other common clustering algorithms
    14 years 9 months ago
    Optimal implementations of UPGMA and other common clustering algorithms
    Download  www.daimi.au.dk
    In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
    Ilan Gronau, Shlomo Moran
    claim paper
    Read More »
    ICIAP
    2007
    ACM
    184views Image Processing» more  ICIAP 2007»
    Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid
    15 years 10 months ago
    Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid
    Download  kogs-www.informatik.uni-hamburg.de
    The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fcc) grid. Thus, the local configurations that are considered when extracting the local su...
    Robin Strand, Peer Stelldinger
    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-2025, USA.