Sciweavers

    ESA
    2006
    Springer
    92views Algorithms» more  ESA 2006»
    Out-of-Order Event Processing in Kinetic Data Structures
    14 years 9 months ago
    Out-of-Order Event Processing in Kinetic Data Structures
    Download  biogeometry.duke.edu
    We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
    Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
    claim paper
    Read More »
    ESA
    2006
    Springer
    126views Algorithms» more  ESA 2006»
    Cooperative TSP
    14 years 9 months ago
    Cooperative TSP
    Download  www.cs.tau.ac.il
    In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
    Amitai Armon, Adi Avidor, Oded Schwartz
    claim paper
    Read More »
    ESA
    2006
    Springer
    77views Algorithms» more  ESA 2006»
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
    14 years 9 months ago
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
    Download  www.cs.rochester.edu
    The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables p...
    Ivona Bezáková, Alistair Sinclair, D...
    claim paper
    Read More »
    DIS
    2006
    Springer
    119views Theoretical Computer Science» more  DIS 2006»
    Kalman Filters and Adaptive Windows for Learning in Data Streams
    14 years 9 months ago
    Kalman Filters and Adaptive Windows for Learning in Data Streams
    Download  www.lsi.upc.edu
    We study the combination of Kalman filter and a recently proposed algorithm for dynamically maintaining a sliding window, for learning from streams of examples. We integrate this i...
    Albert Bifet, Ricard Gavaldà
    claim paper
    Read More »
    DAS
    2006
    Springer
    185views Document Analysis» more  DAS 2006»
    Performance Comparison of Six Algorithms for Page Segmentation
    14 years 9 months ago
    Performance Comparison of Six Algorithms for Page Segmentation
    Download  www.keysers.net
    Abstract. This paper presents a quantitative comparison of six algorithms for page segmentation: X-Y cut, smearing, whitespace analysis, constrained text-line finding, Docstrum, an...
    Faisal Shafait, Daniel Keysers, Thomas M. Breuel
    claim paper
    Read More »
    CPM
    2006
    Springer
    182views Combinatorics» more  CPM 2006»
    Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
    14 years 9 months ago
    Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
    Download  www-ab.informatik.uni-tuebingen.de
    The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
    Johannes Fischer, Volker Heun
    claim paper
    Read More »
    CIAC
    2010
    Springer
    259views Algorithms» more  CIAC 2010»
    On Strategy Improvement Algorithms for Simple Stochastic Games
    14 years 9 months ago
    On Strategy Improvement Algorithms for Simple Stochastic Games
    Download  www.csee.usf.edu
    The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
    Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
    claim paper
    Read More »
    COMPGEOM
    2006
    ACM
    149views Discrete Geometry» more  COMPGEOM 2006»
    I/O-efficient batched union-find and its applications to terrain analysis
    14 years 9 months ago
    I/O-efficient batched union-find and its applications to terrain analysis
    Download  terrain.cs.duke.edu
    Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
    Pankaj K. Agarwal, Lars Arge, Ke Yi
    claim paper
    Read More »
    COCOON
    2006
    Springer
    120views Combinatorics» more  COCOON 2006»
    Finding Patterns with Variable Length Gaps or Don't Cares
    14 years 9 months ago
    Finding Patterns with Variable Length Gaps or Don't Cares
    Download  www.dcs.kcl.ac.uk
    In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
    M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
    claim paper
    Read More »
    COCO
    2006
    Springer
    95views Algorithms» more  COCO 2006»
    Derandomization of Probabilistic Auxiliary Pushdown Automata Classes
    14 years 9 months ago
    Derandomization of Probabilistic Auxiliary Pushdown Automata Classes
    Download  smartech.gatech.edu
    H. Venkateswaran
    claim paper
    Read More »
    « first‹ previous…257258259260261262263264265…next ›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-2025, USA.