Sciweavers

    1278 search results - page 52 / 256
    » The Complexity of Weighted Boolean
    Sort
    View
    CLEF
    2006
    Springer
    157views Information Technology» more  CLEF 2006»
    Blind Relevance Feedback and Named Entity Based Query Expansion for Geographic Retrieval at GeoCLEF 2006
    13 years 11 months ago
    Blind Relevance Feedback and Named Entity Based Query Expansion for Geographic Retrieval at GeoCLEF 2006
    Download  www.l3s.de
    The participation of the University of Hildesheim focused on the monolingual German and English and the bilingual German English tasks of GeoCLEF 2006. Based on the results of Geo...
    Kerstin Bischoff, Thomas Mandl, Christa Womser-Hac...
    claim paper
    Read More »
    JMLR
    2012
    253views Programming Languages» more  JMLR 2012»
    Graphlet decomposition of a weighted network
    11 years 10 months ago
    Graphlet decomposition of a weighted network
    Download  jmlr.csail.mit.edu
    We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
    Hossein Azari Soufiani, Edo Airoldi
    claim paper
    Read More »
    MASCOTS
    2001
    124views Modeling And Simulation» more  MASCOTS 2001»
    Minimizing Routing State for Light-Weight Network Simulation
    13 years 9 months ago
    Minimizing Routing State for Light-Weight Network Simulation
    Download  nslab.ee.ntu.edu.tw
    We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
    Polly Huang, John S. Heidemann
    claim paper
    Read More »
    CCR
    2006
    122views more  CCR 2006»
    Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
    13 years 7 months ago
    Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
    Download  ccr.sigcomm.org
    The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
    Claus Bauer
    claim paper
    Read More »
    DNA
    2006
    Springer
    126views Bioinformatics» more  DNA 2006»
    On the Complexity of Graph Self-assembly in Accretive Systems
    13 years 11 months ago
    On the Complexity of Graph Self-assembly in Accretive Systems
    Download  www.cis.upenn.edu
    We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
    Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
    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.