Filters








18,210 Hits in 6.3 sec

Exact algorithms for single frame selection on multiaxis Satellites

Dezhen Song, A.F. van der Stappen, K. Goldberg
2006 IEEE Transactions on Automation Science and Engineering  
For a set of client requests and a satellite with discrete resolution levels, we give an algorithm that solves the SFS problem in time ( 2 ).  ...  We define a new quality metric and algorithms for solving the problem for the cases of discrete and continuous zoom values.  ...  ACKNOWLEDGMENT The authors would like to thank the reviewers for insightful suggestions. They thank A. Levandowski for bringing the near real-time satellite imaging industry to our attention. Also,  ... 
doi:10.1109/tase.2005.860617 fatcat:r62wz5rbybfuzfpdcp3ehmah5u

An exact algorithm optimizing coverage-resolution for automated satellite frame selection

Dezhen Song, A.F. van der Stappen, K. Goldberg
2004 IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004  
For a set of n client requests we give a series of algorithms, the fastest computes optimal results in O(n 3 ) for satellites with continuously variable resolution.  ...  As a new application area for Automation, Near Real Time Satellite Imaging provides timely optical/radar information which is used for disaster control, surveillance, and military applications.  ...  We de ne a new metric for reward and provide a series of algorithms for solving the nonlinear optimization problem.  ... 
doi:10.1109/robot.2004.1307130 dblp:conf/icra/SongSG04 fatcat:fywnrjcl6ratbatnkn4oyplyke

Graph-Theoretic Solutions to Computational Geometry Problems [chapter]

David Eppstein
2010 Lecture Notes in Computer Science  
Finding a set of floor(n/3) guards can be performed in linear time Linear time triangulation of simple polygons [Chazelle, DCG 1991] Linear time optimal coloring of maximal outerplanar graphs (easy using  ...  Structured vs unstructured metrics Metric embedding problem Given an unstructured metric space find a low-distortion embedding into a structured space or, sometimes (not today) find a random family of  ...  , distortion = max dilation Conclusions Graph-theoretic point of view is useful in many non-graph problems The graph algorithms used for these problems are often classical... maximum independent set  ... 
doi:10.1007/978-3-642-11409-0_1 fatcat:rqrljmkgqrb3ddw5nszva6ighi

Rule Extraction on Numeric Datasets Using Hyper-rectangles

Waldo Hasperué, Laura Cristina Lanzarini, Armando De Giusti
2012 Computer and Information Science  
The participation of an expert for training the model is discussed.  ...  In this paper, a new classification strategy is presented that uses hyper-rectangles as data descriptors to achieve a model that allows extracting knowledge in the form of classification rules.  ...  From a more optimistic viewpoint, this technique may achieve an optimal result in a shorter amount of time.  ... 
doi:10.5539/cis.v5n4p116 fatcat:q5ts7d7s6jek3juou3qsp24nea

New Algorithms for Two-Label Point Labeling [chapter]

Zhongping Qin, Alexander Wolff, Yinfeng Xu, Binhai Zhu
2000 Lecture Notes in Computer Science  
As their predecessors, our algorithms take O(n log n) time and O(n) space. This research was conducted during a visit of Z. Qin and Y. Xu to  ...  Given a label shape L and a set of n points in the plane, the 2-label point-labeling problem consists of placing 2n non-intersecting translated copies of L of maximum size such that each point touches  ...  We wish to thank Otfried Cheong, Hong Kong University of Science and Technology, without whose generous support this research would not have been possible.  ... 
doi:10.1007/3-540-45253-2_34 fatcat:rrjnbj4vwvdejgzbnyvkkbpjsi

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

Bentley, Wood
1980 IEEE transactions on computers  
In this paper we investigate the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane.  ...  This algorithm is optimal to within a constant factor. As an intermediate step of this algorithm, we solve a problem related to the range searching problem that arises in database applications.  ...  ACKNOWLEDGMENT The helpful comments of M. Ast, D. Haken, and the anonymous referees are gratefully acknowledged.  ... 
doi:10.1109/tc.1980.1675628 fatcat:qkawskomnzd7dcl6n7ddas4jnu

Reduction Algorithm for the NPMLE for the Distribution Function of Bivariate Interval-Censored Data

Marloes H Maathuis
2005 Journal of Computational And Graphical Statistics  
The HeightMap algorithm is discussed in detail and also given in pseudo code. It is a very fast and simple algorithm of time complexity O(n^2).  ...  The computation of the NPMLE consists of two steps: a parameter reduction step and an optimization step. In this paper we focus on the reduction step.  ...  The author would like to thank Kris Bogaerts, Shuguang Song, and Alain Vandal for providing the code of their algorithms, and a referee for suggesting to consider generalizing the HeightMap algorithm to  ... 
doi:10.1198/106186005x48470 fatcat:ug6flnsiyzgu3kjvlxbfkr5rem

EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX

SHINYA ANZAI, JINHEE CHUN, RYOSEI KASAI, MATIAS KORMAN, TAKESHI TOKUYAMA
2010 Discrete Mathematics, Algorithms and Applications (DMAA)  
We consider the optimization problem of finding nonintersecting rectangles and tableaux in Ò ¢ Ò pixel plane where each pixel has a real valued weight.  ...  We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.  ...  This is done in Ç´Ò µ time, and hence the problem is in class P if is a constant.  ... 
doi:10.1142/s1793830910000863 fatcat:cnuqvlhzgzhnhi47fypckemla4

Page 1216 of Mathematical Reviews Vol. , Issue 83c [page]

1983 Mathematical Reviews  
Authors’ summary: “Three related rectangle intersection problems in k-dimensional space are considered: (1) find the intersections of a rectangle with a given set of rectangles, (2) find the intersecting  ...  For the first problem the running time is O((logn)?*~'+5s), where s is the number of intersecting pairs of rectangles.  ... 

Page 5029 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
Among other things, these classes provide functions for computing the point at which two skew lines in the plane intersect and for classifying a point relative to a line in the plane or a triangle in space  ...  Algorithms to be covered include two more methods for finding the convex hull of a finite point set (the gift-wrapping method and the Graham scan), a linear-time algorithm for com- puting the intersection  ... 

Learning nested concept classes with limited storage

DAVID HEATH
1996 Journal of experimental and theoretical artificial intelligence (Print)  
Many existing learning methods use incremental algorithms that construct a generalization in one pass through a set of training data and modify it in subsequent passes (e.g.,  ...  Definition 1: In a binary classification problem, an isothetic hypeerectangle with nonzero area is called a blocking rectangle if every edge of the hyperrectangle intersects points of both classes.  ...  We will assume that each point belongs to one of two classes (i.e., we have a binary classification problem). Our algorithms learn by processing examples one at a time, in a random order.  ... 
doi:10.1080/095281396147429 fatcat:eehkpyxmifhnbavvijq5e42sdm

A multifacility location problem on median spaces

Victor Chepoi
1996 Discrete Applied Mathematics  
The complexity of this algorithm for median graphs and networks and  ...  Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems.  ...  For problems (P,) and (PJ this is done in 0(n3) time using the Dinic and Karzanov algorithm [25, 34, 44] . For problems (.c??  ... 
doi:10.1016/0166-218x(95)00115-8 fatcat:v3ndt5eqlzec7pokgswh42gks4

Page 256 of Mathematical Reviews Vol. , Issue 85a [page]

1985 Mathematical Reviews  
The algorithm is called FFS, [NFS,]. Absolute worst-case bounds, roughly seven times the optimal, are found for these algorithms.  ...  The best-case, the worst-case and the average-case complexities are analyzed.” Galil, Zvi (IL-TLAV); Seiferas, Joel (1-RCT-C) 85a:68061 Time-space-optimal string matching. J. Comput.  ... 

Exact algorithms and APX-hardness results for geometric packing and covering problems

Timothy M. Chan, Elyot Grant
2014 Computational geometry  
In contrast, we give a polynomial-time dynamic programming algorithm for geometric set cover where the objects are pseudodisks containing the origin or are downward shadows of pairwise 2-intersecting x-monotone  ...  Our algorithm extends to the weighted case where a minimum-cost cover is required. We give similar algorithms for several related hitting set and discrete packing problems.  ...  Acknowledgements We thank Esther Ezra for discussions on set cover and hitting set for rectangles whose boundaries intersect pairwise exactly zero times or four times; and Sariel Har-Peled for discussions  ... 
doi:10.1016/j.comgeo.2012.04.001 fatcat:jvgkqstvtfbftghlu7logfjhvu

Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux [chapter]

Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama
2010 Lecture Notes in Computer Science  
We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n × n pixel plane where each pixel has a real valued weight.  ...  We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.  ...  Acknowledgments The authors gratefully acknowledge to Sang Won Bae for helpful discussions.  ... 
doi:10.1007/978-3-642-14031-0_27 fatcat:ouzma4pobrhgpeipq3yxiyhcja
« Previous Showing results 1 — 15 out of 18,210 results