Sciweavers

    WALCOM
    2007
    IEEE
    151views Algorithms» more  WALCOM 2007»
    Base Station Placement Problem on the Boundary of a Convex Region
    13 years 11 months ago
    Base Station Placement Problem on the Boundary of a Convex Region
    Download  teacher.buet.ac.bd
    Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
    Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...
    claim paper
    Read More »
    WALCOM
    2007
    IEEE
    109views Algorithms» more  WALCOM 2007»
    Pattern Matching in Degenerate DNA/RNA Sequences
    13 years 11 months ago
    Pattern Matching in Degenerate DNA/RNA Sequences
    Download  www.dcs.kcl.ac.uk
    In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...
    M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mou...
    claim paper
    Read More »
    WALCOM
    2007
    IEEE
    73views Algorithms» more  WALCOM 2007»
    Minimum Face-Spanning Subgraphs of Plane Graphs
    13 years 11 months ago
    Minimum Face-Spanning Subgraphs of Plane Graphs
    Download  folk.uib.no
    Md. Mostofa Ali Patwary, Md. Saidur Rahman
    claim paper
    Read More »
    WALCOM
    2007
    IEEE
    82views Algorithms» more  WALCOM 2007»
    Methods for Searching Mutual Visible-Intervals on Moving Object
    13 years 11 months ago
    Methods for Searching Mutual Visible-Intervals on Moving Object
    Download  teacher.buet.ac.bd
    Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
    Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
    claim paper
    Read More »
    SODA
    1992
    ACM
    95views Algorithms» more  SODA 1992»
    The Probabilistic Method
    13 years 11 months ago
    The Probabilistic Method
    Download  assets.cambridge.org
    Joel Spencer
    claim paper
    Read More »
    SODA
    1992
    ACM
    90views Algorithms» more  SODA 1992»
    Self-Testing Polynomial Functions Efficiently and Over Rational Domains
    13 years 11 months ago
    Self-Testing Polynomial Functions Efficiently and Over Rational Domains
    Download  people.csail.mit.edu
    In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
    Ronitt Rubinfeld, Madhu Sudan
    claim paper
    Read More »
    SODA
    1992
    ACM
    72views Algorithms» more  SODA 1992»
    Tail Estimates for the Space Complexity of Randomized Incremental Algorithms
    13 years 11 months ago
    Tail Estimates for the Space Complexity of Randomized Incremental Algorithms
    Download  edocs.fu-berlin.de
    Kurt Mehlhorn, Micha Sharir, Emo Welzl
    claim paper
    Read More »
    SODA
    1992
    ACM
    140views Algorithms» more  SODA 1992»
    Separation and Approximation of Polyhedral Objects
    13 years 11 months ago
    Separation and Approximation of Polyhedral Objects
    Download  www.ams.sunysb.edu
    Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
    Joseph S. B. Mitchell, Subhash Suri
    claim paper
    Read More »
    SODA
    1992
    ACM
    123views Algorithms» more  SODA 1992»
    Computing Minimal Spanning Subgraphs in Linear Time
    13 years 11 months ago
    Computing Minimal Spanning Subgraphs in Linear Time
    Download  www.cs.utexas.edu
    Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
    Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
    claim paper
    Read More »
    SODA
    1992
    ACM
    96views Algorithms» more  SODA 1992»
    Lower Bounds for On-Line Graph Coloring
    13 years 11 months ago
    Lower Bounds for On-Line Graph Coloring
    Download  www.tcs.fudan.edu.cn
    Magnús M. Halldórsson, Mario Szegedy
    claim paper
    Read More »
    « first‹ previous…141142143144145146147148149…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-2024, USA.