Sciweavers

SODA
1990
ACM
82views Algorithms» more  SODA 1990»
14 years 23 days ago
Visibility with a Moving Point of View
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,...
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
14 years 23 days ago
Factor Refinement
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
IJCAI
1989
14 years 23 days ago
Rapid Retrieval Algorithms for Case-Based Reasoning
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...
IJCAI
1989
14 years 24 days ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
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
UAI
1996
14 years 28 days ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
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
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
14 years 28 days ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
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
SODA
1996
ACM
102views Algorithms» more  SODA 1996»
14 years 28 days ago
On RAM Priority Queues
Mikkel Thorup
SODA
1996
ACM
143views Algorithms» more  SODA 1996»
14 years 28 days ago
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic
Robert Lupton, F. Miller Maley, Neal E. Young
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
14 years 28 days ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
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
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
14 years 28 days ago
Optimal Placement of Convex Polygons to Maximize Point Containment
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