We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Ba...
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Engineering applications that use Active DBMSs (ADBMSs) often need to group activities into modes that are shifted during the execution of different tasks. This paper presents a me...
/Background The SOLAR and HELIOSPHERIC OBSERVATORY (SOHO) project [SOHO Web Page] is being carried out by the European Space Agency (ESA) and the US National Aeronautics and Space ...
Walt Truszkowski, Nick Netreba, Don Ginn, Sanda Ma...