An experimentally motivated model is proposed for the formation of fluid-phase templates corresponding to the porous silica skeletons of diatoms, single-cell organisms found in marine and freshwater environments. It is shown that phase-separation processes on a planar surface may give rise to a quasi-static mold that could direct the deposition of condensing silica to form complex arrays of por...

6 LATEX support 94 6.1 Preliminaries : : : : : : : : : : : : 94 6.2 Creating a new LATEX file : : : : : : 97 6.3 LATEX macros : : : : : : : : : : : : 98 6.4 LATEX environments : : : : : : : : 99 6.5 Common commands : : : : : : : : 99 6.6 Math mode : : : : : : : : : : : : : 100 6.7 Dots, commas, and quotation marks 100 6.8 Font changes : : : : : : : : : : : : 101 6.9 Comments : : : : : : : : : :...

To enhance readability and usability of speech recognition results, automatic punctuation is an essential process. In this paper, we address automatic comma prediction based on conditional random fields (CRF) using lexical, syntactic and pause information. Since there is large disagreement in comma insertion between humans, we model individual tendencies of punctuation using annotations given b...

Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...

We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in < d. We show how this leads to a deterministic optimal O(logn) time parallel algorithm for nding the k-nearest-neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parall...

Let S be a set of points in R. Given a geometric spanner graph, G = (S, E), with constant dilation t, and a positive constant ε, we show how to construct a (1 + ε)-spanner of G with O(|S|) edges in time O(|E|+ |S| log |S|). Previous algorithms require a preliminary step in which the edges are sorted in non-decreasing order of their lengths and, thus, have running time Ω(|E| log |S|). We obtain ...

Given the positions of n sites in a radio network we consider the problem of finding routes between any pair of sites that minimize energy consumption and do not use more than some constant number k of hops. Known exact algorithms for this problem required Ω(n logn) per query pair (p, q). In this paper we relax the exactness requirement and only compute approximate (1+2) solutions which allows ...