Sciweavers

    376 search results - page 24 / 76
    » Betweenness Centrality : Algorithms and Lower Bounds
    Sort
    View
    COMPGEOM
    1992
    ACM
    120views Discrete Geometry» more  COMPGEOM 1992»
    On-Line Steiner Trees in the Euclidean Plane
    13 years 11 months ago
    On-Line Steiner Trees in the Euclidean Plane
    Download  www.cs.tau.ac.il
    Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
    Noga Alon, Yossi Azar
    claim paper
    Read More »
    MONET
    2008
    135views more  MONET 2008»
    Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
    13 years 7 months ago
    Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
    Download  www.cs.ucsb.edu
    This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
    Lili Cao, Haitao Zheng
    claim paper
    Read More »
    DCOSS
    2010
    Springer
    206views Distributed And Parallel Com...» more  DCOSS 2010»
    Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
    13 years 11 months ago
    Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
    Download  www.ece.ucsb.edu
    Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
    Prabir Barooah, Wm. Joshua Russell, João P....
    claim paper
    Read More »
    VMV
    2008
    151views Visualization» more  VMV 2008»
    Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
    13 years 9 months ago
    Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
    Download  cg.informatik.uni-freiburg.de
    We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
    Marc Gissler, Matthias Teschner
    claim paper
    Read More »
    CGF
    2000
    81views more  CGF 2000»
    Generating Consistent Motion Transition via Decoupled Framespace Interpolation
    13 years 7 months ago
    Generating Consistent Motion Transition via Decoupled Framespace Interpolation
    Download  www.comp.nus.edu.sg
    espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
    Golam Ashraf, Kok Cheong Wong
    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.