JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Title
Now showing items 1859818617 of 37280

Efficient Parallel Algorithms for Covering Binary Images
Moitra, Dipen (Cornell University, 198905)Given a black and white image, represented by an array of $\surd$ n x $\surd$ n binary valued pixels, we wish to cover the black pixels with a minimal set of (possible overlapping) maximal squares. It was recently shown ... 
Efficient Parallel Algorithms for Disjoint Paths and Connectivity
Khuller, Samir (Cornell University, 199007)This thesis is concerned with the problem of designing efficient parallel algorithms for various graphtheoretic problems. Our larger goal is to identify "tools" that would be useful in designing parallel algorithms for ... 
Efficient Parallel Solutions of Large Sparse SPD Systems on Distributedmemory Multiprocessors
Sun, Chunguang (Cornell University, 199208)We consider several issues involved in the solution of sparse symmetric positive definite system by multifrontal method on distributedmemory multiprocessors. First, we present a new algorithm for computing the ... 
Efficient Planarity Testing
Hopcroft, John E.; Tarjan, Robert Endre (Cornell University, 197304)This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter ... 
Efficient Program Analysis Using Dependence Flow Graphs
Johnson, Richard C. (Cornell University, 199411)Program analysis plays a major role in advanced compilers, yet traditional approaches to data flow analysis are quite time consuming. Prior techniques for speeding up data flow analysis have either exploited program structure ... 
Efficient Ranking And Selection In Parallel Computing Environments
Ni, Cao (20160201)The goal of ranking and selection (R&S) procedures is to identify the best stochastic system from among a finite set of competing alternatives. Such procedures require constructing estimates of each system's performance, ... 
Efficient Reconciliation of Unordered Databases
Minsky, Yaron; Trachtenberg, Ari (Cornell University, 199911)We consider the problem of reconciling two unordered databases whose contents are related. Specifically, we wish to determine the mutual difference of these databases with a minimum communication complexity. This type ... 
Efficient Resolution of Singularities of Plane Curves
Kozen, Dexter (Cornell University, 199404)We give a new algorithm for resolving singularities of plane curves. The algorithm is polynomial time in the bit complexity model, does not require factorization, and works over the rationals or finite fields. 
Efficient Retinal Ganglion Cell Coding and the Statistics of Natural Scenes
Graham, Daniel Jacob (20040714)The structure of the early stages of the visual system is thought to be wellmatched to the particular statistics that characterize the visual environment. Retinal ganglion cells in vertebrates and analogous retinal units ... 
Efficient Runtime Detection And Toleration Of Asymmetric Races
Ratanaworabhan, Paruj (20100409)This work introduces ToleRace, a runtime system that allows parallel programs to detect and even tolerate asymmetric data races. Asymmetric races are race conditions where one thread correctly acquires and releases a lock ... 
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
Pearson, David; Vazirani, Vijay V. (Cornell University, 199108)A maximal bipartite set (MBS) in an undirected graph $G = (V, E)$ is a maximal collection of vertices $B \subseteq$ V$ whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and ... 
An Efficient Staggering Algorithm for the Warehouse Scheduling Problem
Jackson, P. L.; Hariga, M. A. (Cornell University Operations Research and Industrial Engineering, 199404)An Efficient Staggering Algorithm for the Warehouse Scheduling Problem 
An efficient trust region method for unconstrained discretetime optimal control problems
Coleman, Thomas F.; Liao, Aiping (Cornell University, 20031111)Discretetime optimal control (DTOC) problems are largescale optimization problems with a dynamic structure. In previous work this structure has been exploited to provide very fast and efficient local procedures. Two ... 
An Efficient Trust Region Method for Unconstrained DiscreteTime Optimal Control Problems
Coleman, Thomas F.; Liao, Aiping (Cornell University, 199307)Discretetime optimal control (DTOC) problems are largescaleoptimization problems with a dynamic structure. In previous work this structure has been exploited to provide very fast and efficient local procedures. Two ... 
Efficient, Effective LotSizing for MultiProduct MultiStage Production/Distribution Systems with Correlated Demands
Roundy, R. (Cornell University Operations Research and Industrial Engineering, 198805)Efficient, Effective LotSizing for MultiProduct MultiStage Production/Distribution Systems with Correlated Demands 
Efficient, Effective LotSizing for MultiProduct MultiStage Production/Distribution Systems with Correlated Demands
Roundy, R. (Cornell University Operations Research and Industrial Engineering, 198508)Efficient, Effective LotSizing for MultiProduct MultiStage Production/Distribution Systems with Correlated Demands 
An Efficiently Computable Metric for Comparing Polygonal Shapes
Arkin, E. M.; Chew, L. P.; Huttenlocher, D. P.; Kedem, K.; Mitchell, J. S. B. (Cornell University Operations Research and Industrial Engineering, 198905)An Efficiently Computable Metric for Comparing Polygonal Shapes 
Efficiently Exploring Architectural Design Spaces via Predictive Modeling
Ipek, Engin (20070714)Computer architects rely on cyclebycycle simulation to evaluate the impact of design choices and to understand tradeoffs and interactions among design parameters. Although several techniques reduce time per individual ... 
Efficiently Using Invariant Theory and Grouping Information for ModelBased Matching
Wayner, Peter C. (Cornell University, 199011)This paper presents a method for efficiently maintaining and searching a database of threedimensional models so they can be reliable recognized from arbitrary twodimensional projections in the presence of noise and ... 
Efforts To Broaden And Facilitate Pulsar Timing Array Searches For Gravitational Radiation
Madison, Dustin (20150524)Pulsar timing has been an irreplaceable technique in studies of gravitational radiation for decades and is now poised to allow direct detection and investigation of nanohertz gravitational waves (GWs). The most promising ...