Sciweavers

    TCSV
    2008
    131views more  TCSV 2008»
    Fast Optimal Motion Estimation Based on Gradient-Based Adaptive Multilevel Successive Elimination
    13 years 9 months ago
    Fast Optimal Motion Estimation Based on Gradient-Based Adaptive Multilevel Successive Elimination
    Download  www.cs.nthu.edu.tw
    In this paper, we propose a fast and optimal solution for block motion estimation based on an adaptive multilevel successive elimination algorithm. This algorithm is accomplished b...
    Shao-Wei Liu, Shou-Der Wei, Shang-Hong Lai
    claim paper
    Read More »
    IS
    2007
    102views Artificial Intelligence» more  IS 2007»
    Mining association rules in very large clustered domains
    13 years 9 months ago
    Mining association rules in very large clustered domains
    Download  delab.csd.auth.gr
    Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
    Alexandros Nanopoulos, Apostolos N. Papadopoulos, ...
    claim paper
    Read More »
    IS
    2007
    125views Artificial Intelligence» more  IS 2007»
    Efficient processing of XPath queries using indexes
    13 years 9 months ago
    Efficient processing of XPath queries using indexes
    Download  www.cais.ntu.edu.sg
    : A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
    Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
    claim paper
    Read More »
    TCS
    2008
    102views Theoretical Computer Science» more  TCS 2008»
    Main-memory triangle computations for very large (sparse (power-law)) graphs
    13 years 9 months ago
    Main-memory triangle computations for very large (sparse (power-law)) graphs
    Download  www-rp.lip6.fr
    Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
    Matthieu Latapy
    claim paper
    Read More »
    IPL
    2007
    79views more  IPL 2007»
    Uniform metrical task systems with a limited number of states
    13 years 9 months ago
    Uniform metrical task systems with a limited number of states
    Download  www.egr.unlv.edu
    We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
    Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    claim paper
    Read More »
    IPL
    2007
    69views more  IPL 2007»
    On the fixed-parameter tractability of the equivalence test of monotone normal forms
    13 years 9 months ago
    On the fixed-parameter tractability of the equivalence test of monotone normal forms
    Download  www.uni-weimar.de
    We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
    Matthias Hagen
    claim paper
    Read More »
    IPL
    2007
    81views more  IPL 2007»
    Linear-time algorithms for problems on planar graphs with fixed disk dimension
    13 years 9 months ago
    Linear-time algorithms for problems on planar graphs with fixed disk dimension
    Download  www.csm.lau.edu.lb
    The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
    Faisal N. Abu-Khzam, Michael A. Langston
    claim paper
    Read More »
    IPL
    2007
    89views more  IPL 2007»
    On the longest path algorithm for reconstructing trees from distance matrices
    13 years 9 months ago
    On the longest path algorithm for reconstructing trees from distance matrices
    Download  www.cs.yale.edu
    Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
    Lev Reyzin, Nikhil Srivastava
    claim paper
    Read More »
    AUTOMATICA
    2005
    82views more  AUTOMATICA 2005»
    Consistency analysis of some closed-loop subspace identification methods
    13 years 9 months ago
    Consistency analysis of some closed-loop subspace identification methods
    Download  www.dei.unipd.it
    We study statistical consistency of two recently proposed subspace identification algorithms for closed-loop systems. These algorithms een as implementations of an abstract state-...
    Alessandro Chiuso, Giorgio Picci
    claim paper
    Read More »
    IOR
    2007
    119views more  IOR 2007»
    A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
    13 years 9 months ago
    A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
    Download  www.sys.virginia.edu
    We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
    Alfredo Garcia, Stephen D. Patek, Kaushik Sinha
    claim paper
    Read More »
    « first‹ previous…99100101102103104105106107…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.