Sciweavers

    ALGORITHMICA
    1998
    90views more  ALGORITHMICA 1998»
    Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
    13 years 11 months ago
    Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
    Download  www.csie.nuk.edu.tw
    We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
    Brigitte Vallée
    claim paper
    Read More »
    ALGORITHMICA
    1998
    67views more  ALGORITHMICA 1998»
    On a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion
    13 years 11 months ago
    On a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion
    Download  www.ra.cs.uni-tuebingen.de
    Alex J. Smola, Bernhard Schölkopf
    claim paper
    Read More »
    ALGORITHMICA
    1998
    81views more  ALGORITHMICA 1998»
    The List Update Problem: Improved Bounds for the Counter Scheme
    13 years 11 months ago
    The List Update Problem: Improved Bounds for the Counter Scheme
    Download  www.cs.technion.ac.il
    We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
    Hadas Shachnai, Micha Hofri
    claim paper
    Read More »
    ALGORITHMICA
    1998
    73views more  ALGORITHMICA 1998»
    Linear Probing and Graphs
    13 years 11 months ago
    Linear Probing and Graphs
    Download  www.cs.aue.auc.dk
    Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
    Donald E. Knuth
    claim paper
    Read More »
    ALGORITHMICA
    1998
    94views more  ALGORITHMICA 1998»
    A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
    13 years 11 months ago
    A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
    Download  www.cs.brown.edu
    In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
    Philip N. Klein, Sairam Subramanian
    claim paper
    Read More »
    ALGORITHMICA
    1998
    79views more  ALGORITHMICA 1998»
    Finding Largest Subtrees and Smallest Supertrees
    13 years 11 months ago
    Finding Largest Subtrees and Smallest Supertrees
    Download  www.cs.uwaterloo.ca
    Arvind Gupta, Naomi Nishimura
    claim paper
    Read More »
    ALGORITHMICA
    1998
    184views more  ALGORITHMICA 1998»
    Approximation Algorithms for Connected Dominating Sets
    13 years 11 months ago
    Approximation Algorithms for Connected Dominating Sets
    Download  www.cis.upenn.edu
    The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
    Sudipto Guha, Samir Khuller
    claim paper
    Read More »
    ALGORITHMICA
    1998
    118views more  ALGORITHMICA 1998»
    On the Analysis of Linear Probing Hashing
    13 years 11 months ago
    On the Analysis of Linear Probing Hashing
    Download  algo.inria.fr
    Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
    Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
    claim paper
    Read More »
    ALGORITHMICA
    1998
    111views more  ALGORITHMICA 1998»
    A Note on Point Location in Delaunay Triangulations of Random Points
    13 years 11 months ago
    A Note on Point Location in Delaunay Triangulations of Random Points
    Download  cg.scs.carleton.ca
    This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
    Luc Devroye, Ernst P. Mücke, Binhai Zhu
    claim paper
    Read More »
    ALGORITHMICA
    1998
    103views more  ALGORITHMICA 1998»
    On Bayes Methods for On-Line Boolean Prediction
    13 years 11 months ago
    On Bayes Methods for On-Line Boolean Prediction
    Download  homes.dsi.unimi.it
    We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
    Nicolò Cesa-Bianchi, David P. Helmbold, San...
    claim paper
    Read More »
    12next ›last »
    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.