Sciweavers

    5115 search results - page 14 / 1023
    » On Randomized Lanczos Algorithms
    Sort
    View
    NIPS
    2003
    115views Information Technology» more  NIPS 2003»
    From Algorithmic to Subjective Randomness
    13 years 8 months ago
    From Algorithmic to Subjective Randomness
    Download  cocosci.berkeley.edu
    We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
    Thomas L. Griffiths, Joshua B. Tenenbaum
    claim paper
    Read More »
    CN
    2007
    148views more  CN 2007»
    Optimizing random walk search algorithms in P2P networks
    13 years 6 months ago
    Optimizing random walk search algorithms in P2P networks
    Download  www.ecse.rpi.edu
    In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
    Nabhendra Bisnik, Alhussein A. Abouzeid
    claim paper
    Read More »
    COCOON
    2005
    Springer
    125views Combinatorics» more  COCOON 2005»
    Randomized Quicksort and the Entropy of the Random Source
    14 years 8 days ago
    Randomized Quicksort and the Entropy of the Random Source
    Download  drops.dagstuhl.de
    Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
    Beatrice List, Markus Maucher, Uwe Schöning, ...
    claim paper
    Read More »
    KDD
    2012
    ACM
    235views Data Mining» more  KDD 2012»
    A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
    11 years 9 months ago
    A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
    Download  www.itu.dk
    Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
    Ninh Pham, Rasmus Pagh
    claim paper
    Read More »
    SODA
    2003
    ACM
    125views Algorithms» more  SODA 2003»
    Random MAX SAT, random MAX CUT, and their phase transitions
    13 years 8 months ago
    Random MAX SAT, random MAX CUT, and their phase transitions
    Download  www-math.mit.edu
    With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
    Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
    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.