Accurate Hardware RAID Simulator

In this paper, we extend an existing parser to produce richer output annotated with function labels. We obtain state-of-the-art results both in function labelling and in parsing, by automatically relabelling the Penn Treebank trees. In particular, we obtain the best published results on semantic function labels. This suggests that current statistical parsing methods are sufficiently general to ...

We present a novel algorithm for accurate, high quality point rendering, which is based on the formulation of splatting using homogeneous coordinates. In contrast to previous methods, this leads to perspective correct splat shapes, avoiding artifacts such as holes caused by the affine approximation of the perspective projection. Further, our algorithm implements the EWA resampling filter, hence...

The goal of this work was to further improve an experimental proton radiosurgery system at Loma Linda University Medical Center to reach sub-millimeter accuracy before proton radiosurgery with narrow beams can be used in a clinical trial. Radiosurgery precisely targets a specific anatomical region with high doses of radiation. We have developed a program that provides correcting translational o...

Stereoscopic matching is an ill-posed task. We bring a review of basic state of the art methods and show where the main weaknesses of the classical approach are: discretization artifacts and a geometric and illumination distortion. We present a proposal of a complex correlation statistic, which should tackle these problems. It is a similarity statistic which gathers information about the invari...

We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar. Indeed, its performance of 86.36% (LP/LR F1) is better than that of early lexicalized PCFG models, and surprisingly close to the current state-of-thear...

In this paper, we propose an alternate approach to ad-hoc networking called Best Effort multi-Hop Geographical Routing (BEHGR). BEHGR does not fit under the current classifications of on-demand or table-based approaches to ad-hoc routing, but instead statistically attempts to dynamically route packets to a central location in a “best effort” manner. The basis of such a protocol assumes that a s...

The knowledge about failures needed to solve distributed agreement problems can be expressed in terms of completeness and accuracy properties of failure detectors introduced by Chandra and Toueg. The accuracy properties they have considered restrict the false suspicions that can be made by all the processes in the system. In this paper, we deene \??accurate" failure detectors, whose accuracy pr...

It is possible to recover the three-dimensional structure of a scene using images taken with uncalibrated cameras and pixel correspondences. But such a reconstruction can only be computed up to a projective transformation of the 3D space. Therefore, constraints have to be added to the reconstructed data in order to get the reconstruction in the euclidean space. Such constraints arise from knowl...

The standard approach to program transformation involves the use of discrete logical reasoning to prove that the transformation does not change the observable semantics of the program. We propose a new approach that, in contrast, uses probabilistic reasoning to justify the application of transformations that may change, within probabilistic accuracy bounds, the result that the program produces....