Sciweavers

    2652 search results - page 434 / 531
    » Privacy-preserving linear programming
    Sort
    View
    IPCO
    2010
    148views Optimization» more  IPCO 2010»
    Prize-Collecting Steiner Network Problems
    14 years 11 months ago
    Prize-Collecting Steiner Network Problems
    Download  www.openu.ac.il
    In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
    MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
    claim paper
    Read More »
    EMNLP
    2008
    67views Natural Language Processing» more  EMNLP 2008»
    Jointly Combining Implicit Constraints Improves Temporal Ordering
    14 years 11 months ago
    Jointly Combining Implicit Constraints Improves Temporal Ordering
    Download  nlp.stanford.edu
    Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
    Nathanael Chambers, Daniel Jurafsky
    claim paper
    Read More »
    NIPS
    2008
    136views Information Technology» more  NIPS 2008»
    Clusters and Coarse Partitions in LP Relaxations
    14 years 11 months ago
    Clusters and Coarse Partitions in LP Relaxations
    Download  people.csail.mit.edu
    We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
    David Sontag, Amir Globerson, Tommi Jaakkola
    claim paper
    Read More »
    NIPS
    2008
    138views Information Technology» more  NIPS 2008»
    An Extended Level Method for Efficient Multiple Kernel Learning
    14 years 11 months ago
    An Extended Level Method for Efficient Multiple Kernel Learning
    Download  www.cse.cuhk.edu.hk
    We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
    Zenglin Xu, Rong Jin, Irwin King, Michael R. Lyu
    claim paper
    Read More »
    NIPS
    2008
    129views Information Technology» more  NIPS 2008»
    Improved Moves for Truncated Convex Models
    14 years 11 months ago
    Improved Moves for Truncated Convex Models
    Download  cms.brookes.ac.uk
    We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
    M. Pawan Kumar, Philip H. S. Torr
    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.