Sciweavers

    796 search results - page 129 / 160
    » Approximating the centroid is hard
    Sort
    View
    STOC
    2009
    ACM
    150views Algorithms» more  STOC 2009»
    Integrality gaps for Sherali-Adams relaxations
    14 years 8 months ago
    Integrality gaps for Sherali-Adams relaxations
    Download  www.cs.princeton.edu
    We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
    Moses Charikar, Konstantin Makarychev, Yury Makary...
    claim paper
    Read More »
    KDD
    2009
    ACM
    305views Data Mining» more  KDD 2009»
    Grocery shopping recommendations based on basket-sensitive random walk
    14 years 8 months ago
    Grocery shopping recommendations based on basket-sensitive random walk
    Download  www-ai.cs.uni-dortmund.de
    We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
    Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
    claim paper
    Read More »
    KDD
    2009
    ACM
    190views Data Mining» more  KDD 2009»
    Efficient influence maximization in social networks
    14 years 8 months ago
    Efficient influence maximization in social networks
    Download  research.microsoft.com
    Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
    Wei Chen, Yajun Wang, Siyu Yang
    claim paper
    Read More »
    PODS
    2009
    ACM
    134views Database» more  PODS 2009»
    An efficient rigorous approach for identifying statistically significant frequent itemsets
    14 years 8 months ago
    An efficient rigorous approach for identifying statistically significant frequent itemsets
    Download  www.eecs.harvard.edu
    As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
    Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
    claim paper
    Read More »
    PODS
    2009
    ACM
    130views Database» more  PODS 2009»
    Secondary indexing in one dimension: beyond b-trees and bitmap indexes
    14 years 8 months ago
    Secondary indexing in one dimension: beyond b-trees and bitmap indexes
    Download  www.itu.dk
    Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
    Rasmus Pagh, Srinivasa Rao Satti
    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.