“Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical

The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms

This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal

We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a

to the correct marginals. However, on the QMR network, the loopy be liefs oscillated and had no obvious relation ship to the correct posteriors. We present some initial investigations into the cause of these oscillations, and show that some sim ple methods of preventing them lead to the wrong results

hope to be able to reveal more clearly the problems and potential solutions associated with the usual approach. I. Specification of the AIDS In much of the recent literature on systems of demand equations, the starting point has been the specification of a function which is general enough to act as a

by the task of learning to classify web pages. For example, the description of a web page can be partitioned into the words occurring on that page, and the words occurring in hyperlinks that point to that page. We assume that either view of the example would be su cient for learning if we had enough labeled

~- (1, and then the result is classical. A simple proof appears in Enriques-Chisini [E, vol. 3, chap. 3], based on analyzing the totality of coverings of p1 of degree n, with a fixed number d of ordinary branch points. This method has been extended to char. p by William Fulton [F], using specializations

with changes in credit spreads. We discuss these proposed determinants individually. Changes in the Spot Rate As pointed out by Longstaff and Schwartz (1995), the static effect of a higher spot rate is to increase the risk-neutral drift of the firm value process. A higher drift reduces the incidence of default

Fourier transform. The affordability, availability, and applications of MRI remain limited by the time required to sam-ple enough points of k-space for the desired field of view (FOV), resolution, and signal-to-noise ratio (SNR). GRAPPA, an accelerated parallel imaging method, and compressed sensing (CS