Sciweavers

    279 search results - page 27 / 56
    » Approximating Average Parameters of Graphs
    Sort
    View
    GANDC
    2011
    93views more  GANDC 2011»
    Bayesian spatial modeling and interpolation using copulas
    12 years 7 months ago
    Bayesian spatial modeling and interpolation using copulas
    Download  www.math.uni-klu.ac.at
    Copulas have attracted much attention in spatial statistics over the past few years. They are used as a flexible alternative to traditional methods for nonGaussian spatial modelin...
    Hannes Kazianka, Jürgen Pilz
    claim paper
    Read More »
    UAI
    2003
    154views Artificial Intelligence» more  UAI 2003»
    Learning Generative Models of Similarity Matrices
    13 years 9 months ago
    Learning Generative Models of Similarity Matrices
    Download  people.csail.mit.edu
    Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
    Rómer Rosales, Brendan J. Frey
    claim paper
    Read More »
    AAAI
    2011
    139views Intelligent Agents» more  AAAI 2011»
    Exploiting Phase Transition in Latent Networks for Clustering
    12 years 7 months ago
    Exploiting Phase Transition in Latent Networks for Clustering
    Download  www-personal.umich.edu
    In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
    Vahed Qazvinian, Dragomir R. Radev
    claim paper
    Read More »
    EACL
    2006
    ACL Anthology
    134views Natural Language Processing» more  EACL 2006»
    Constraints on Non-Projective Dependency Parsing
    13 years 9 months ago
    Constraints on Non-Projective Dependency Parsing
    Download  acl.ldc.upenn.edu
    We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
    Joakim Nivre
    claim paper
    Read More »
    ECCC
    2011
    205views ECommerce» more  ECCC 2011»
    Graphs of Bounded Treewidth can be Canonized in AC1
    13 years 2 months ago
    Graphs of Bounded Treewidth can be Canonized in AC1
    Download  www.uni-ulm.de
    In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
    Fabian Wagner
    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.