… • A recursion tree models the costs (time) of a recursive execution of an algorithm. • The
recursion-tree method can be unreliable, just like any method that uses ellipses (…). • The …

… or Lawler and Meggido's minimum ratio weight cycle algorithm. These are two interesting
graph algorithms that have not been previously exploited in vision. One of the algorithms …

… This book is designed to provide a comprehensive introduction to the design and analysis
of computer algorithms and data structures. In terms of the computer science and computer …

… This has applications to the study of genetic algorithms with zero or extremely low mutation
rate. (iii) We discuss a variety of convergent simulated-annealing-type algorithms with …

… This paper attempts to cover the main algorithms used for clustering, with a brief and
simple description of each. For each algorithm, I have selected the most common version to …

… , a biannual conference series running successfully since 2001, special sessions and workshops
… In this chapter, we provide a brief introduction to its operating principles and outline the …

… overview of both the theory and algorithms of kernel classifiers, including the most recent
developments. It begins by describing the major algorithmic advances: kernel perceptron …

A practical and accessible introduction to numerical methods for stochastic differential
equations is given. The reader is assumed to be familiar with Euler's method for deterministic …

… Discussion open until December 1, 2001. To extend the closing date one month, a written
request must be filed with the ASCE Manager of Journals. The manuscript for this paper was …

… a tight and efficient integration of spatial data mining algorithms with spatial database
systems. In section 3 through 6, we then present algorithms for the tasks of spatial clustering, …