Results 1 - 10
of
2,648
Base-calling of automated sequencer traces using phred. I. Accuracy Assessment
- GENOME RES
, 1998
"... The availability of massive amounts of DNA sequence information has begun to revolutionize the practice of biology. As a result, current large-scale sequencing output, while impressive, is not adequate to keep pace with growing demand and, in particular, is far short of what will be required to obta ..."
Abstract
-
Cited by 1653 (4 self)
- Add to MetaCart
improved accuracy of the data processing software and reliable accuracy measures to reduce the need for human involvement in error correction and make human review more efficient. Here, we describe one step toward that goal: a base-calling program for automated sequencer traces, phred, with improved
A tool for checking ANSI-C programs
- In Tools and Algorithms for the Construction and Analysis of Systems
, 2004
"... Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C language features, including pointer constructs, dynamic memory allocation, recursion, and the float and double data types. ..."
Abstract
-
Cited by 326 (35 self)
- Add to MetaCart
. From the perspective of the user, the verification is highly automated: the only input required is the BMC bound. The tool is integrated into a graphical user interface. This is essential for presenting long counterexample traces: the tool allows stepping through the trace in the same way a debugger
Detecting Stepping Stones
, 2000
"... One widely-used technique by which network attackers attain anonymity and complicate their apprehension is by employing stepping stones: they launch attacks not from their own computer but from intermediary hosts that they previously compromised. We develop an efficient algorithm for detecting stepp ..."
Abstract
-
Cited by 192 (8 self)
- Add to MetaCart
on large Internet access traces and find that it performs quite well. However, the success of the algorithm is tempered by the discovery that large sites have many users who routinely traverse stepping stones for a variety of legitimate reasons. Hence, stepping-stone detection also requires a significant
Describing the uncertainties in experimental results
- Experimental Thermal and Fluid Science
, 1998
"... I I It is no longer acceptable, in most circles, to present experimental results without describing the uncertainties involved. Besides its obvious role in pub-lishing, uncertainty analysis provides the experimenter a rational way of eval-uating the significance of the scatter on repeated trials. Th ..."
Abstract
-
Cited by 281 (2 self)
- Add to MetaCart
-gineering measurements and the relationship between error and uncertainty. Then the path of an uncertainty analysis is traced from its first step, identify-ing the intended true value of a measurement, through the quantitative estima-tion of the individual errors, to the end objective--the interpretation a d re
Global Illumination using Photon Maps
, 1996
"... This paper presents a two pass global illumination method based on the concept of photon maps. It represents a significant improvement of a previously described approach both with respect to speed, accuracy and versatility. In the first pass two photon maps are created by emitting packets of energy ..."
Abstract
-
Cited by 272 (9 self)
- Add to MetaCart
(photons) from the light sources and storing these as they hit surfaces within the scene. We use one high resolution caustics photon map to render caustics that are visualized directly and one low resolution photon map that is used during the rendering step. The scene is rendered using a distribution ray
Fast Algorithms for Volume Ray Tracing
, 1992
"... We examine various simple algorithms that exploit homogeneity and accumulated opacity for tracing rays through shaded volumes. Most of these methods have error criteria which allow them to trade quality for speed. The time vs. quality tradeoff for these adaptive methods is compared to fixed step mul ..."
Abstract
-
Cited by 121 (0 self)
- Add to MetaCart
We examine various simple algorithms that exploit homogeneity and accumulated opacity for tracing rays through shaded volumes. Most of these methods have error criteria which allow them to trade quality for speed. The time vs. quality tradeoff for these adaptive methods is compared to fixed step
Backward Ray Tracing
- In ACM SIGGRAPH ’86 Course Notes - Developments in Ray Tracing
, 1986
"... Introduction Ray tracing has become a very popular method for image synthesis due to its unparalleled flexibility and its ability the generate images of high quality and realism. Simulation of effects such as reflection and refraction have been the hallmarks of ray tracing since its introduction [5 ..."
Abstract
-
Cited by 99 (1 self)
- Add to MetaCart
tracing which takes a first step toward alleviating this deficiency. The problem addressed
Sphere Tracing: A Geometric Method for the Antialiased Ray Tracing of Implicit Surfaces
- The Visual Computer
, 1994
"... Sphere tracing is a new technique for rendering implicit surfaces using geometric distance. Distance-based models are common in computer-aided geometric design and in the modeling of articulated figures. Given a function returning the distance to an object, sphere tracing marches along the ray towar ..."
Abstract
-
Cited by 81 (2 self)
- Add to MetaCart
toward its first intersection in steps guaranteed not to penetrate the implicit surface. Sphere tracing is particularly adept at rendering pathological surfaces. Creased and rough implicit surfaces are defined by functions with discontinuous or undefined derivatives. Current root finding techniques
Trace ratio vs. ratio trace for dimensionality reduction
- Proceedings of Conference on Computer Vision and Pattern Recognition (CVPR
, 2007
"... A large family of algorithms for dimensionality reduc-tion end with solving a Trace Ratio problem in the form of argmaxW Tr(WTSpW)/Tr(WTSlW)1, which is gener-ally transformed into the corresponding Ratio Trace form argmaxW Tr [ (WTSlW)−1(WTSpW) ] for obtaining a closed-form but inexact solution. In ..."
Abstract
-
Cited by 55 (10 self)
- Add to MetaCart
. In this work, an efficient iterative procedure is presented to directly solve the Trace Ratio problem. In each step, a Trace Difference problem argmaxW Tr[WT (Sp−λSl)W] is solved with λ being the trace ratio value computed from the previous step. Con-vergence of the projection matrix W, as well as the global
Alternating refinement relations
- In Proceedings of the Ninth International Conference on Concurrency Theory (CONCUR’98), volume 1466 of LNCS
, 1998
"... Abstract. Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system components. Unlike in labeled transition systems, where each transition corresponds to a possible step of the syste ..."
Abstract
-
Cited by 166 (20 self)
- Add to MetaCart
Abstract. Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system components. Unlike in labeled transition systems, where each transition corresponds to a possible step
Results 1 - 10
of
2,648