Sciweavers

    SODA
    1990
    ACM
    82views Algorithms» more  SODA 1990»
    Visibility with a Moving Point of View
    13 years 11 months ago
    Visibility with a Moving Point of View
    Download  www.ics.uci.edu
    We investigate 3-d visibility problems in which the viewing position moves along a straight flightpath. Specifically we focus on two problems: determining the points along the fli...
    Marshall W. Bern, David P. Dobkin, David Eppstein,...
    claim paper
    Read More »
    SODA
    1990
    ACM
    49views Algorithms» more  SODA 1990»
    Factor Refinement
    13 years 11 months ago
    Factor Refinement
    Download  cr.yp.to
    Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
    Eric Bach, James R. Driscoll, Jeffrey Shallit
    claim paper
    Read More »
    IJCAI
    1989
    100views Artificial Intelligence» more  IJCAI 1989»
    Rapid Retrieval Algorithms for Case-Based Reasoning
    13 years 11 months ago
    Rapid Retrieval Algorithms for Case-Based Reasoning
    Download  dli.iiit.ac.in
    One of the major issues confronting case-based reasoning (CBR) is rapid retrieval of similar cases from a large case base. This paper describes three algorithms which address this...
    Richard H. Stottler, Andrea L. Henke, James A. Kin...
    claim paper
    Read More »
    IJCAI
    1989
    108views Artificial Intelligence» more  IJCAI 1989»
    Constraint Satisfiability Algorithms for Interactive Student Scheduling
    13 years 11 months ago
    Constraint Satisfiability Algorithms for Interactive Student Scheduling
    Download  dli.iiit.ac.in
    A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
    Ronen Feldman, Martin Charles Golumbic
    claim paper
    Read More »
    UAI
    1996
    147views Artificial Intelligence» more  UAI 1996»
    An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
    13 years 11 months ago
    An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
    Download  www.ics.uci.edu
    Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
    Yousri El Fattah, Rina Dechter
    claim paper
    Read More »
    SODA
    1996
    ACM
    95views Algorithms» more  SODA 1996»
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    13 years 11 months ago
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    Download  www.csc.liv.ac.uk
    We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
    Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
    claim paper
    Read More »
    SODA
    1996
    ACM
    102views Algorithms» more  SODA 1996»
    On RAM Priority Queues
    13 years 11 months ago
    On RAM Priority Queues
    Download  www.cs.colostate.edu
    Mikkel Thorup
    claim paper
    Read More »
    SODA
    1996
    ACM
    143views Algorithms» more  SODA 1996»
    Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic
    13 years 11 months ago
    Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic
    Download  www.cs.ucr.edu
    Robert Lupton, F. Miller Maley, Neal E. Young
    claim paper
    Read More »
    SODA
    1996
    ACM
    157views Algorithms» more  SODA 1996»
    Routing and Admission Control in General Topology Networks with Poisson Arrivals
    13 years 11 months ago
    Routing and Admission Control in General Topology Networks with Poisson Arrivals
    Download  infolab.stanford.edu
    Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
    Anil Kamath, Omri Palmon, Serge A. Plotkin
    claim paper
    Read More »
    SODA
    1996
    ACM
    121views Algorithms» more  SODA 1996»
    Optimal Placement of Convex Polygons to Maximize Point Containment
    13 years 11 months ago
    Optimal Placement of Convex Polygons to Maximize Point Containment
    Download  community.middlebury.edu
    Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
    Matthew Dickerson, Daniel Scharstein
    claim paper
    Read More »
    « first‹ previous…143144145146147148149150151…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.