Results 1  10
of
1,720,418
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 418 (15 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... 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 ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
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
A New VoronoiBased Surface Reconstruction Algorithm
, 2002
"... We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in R³. The algorithm is the first for this problem with provable guarantees. Given a “good sample” from a smooth surface, the output is guaranteed to be topologically correct and converg ..."
Abstract

Cited by 422 (9 self)
 Add to MetaCart
, rather than approximates, the input points. Our algorithm is based on the threedimensional Voronoi diagram. Given a good program for this fundamental subroutine, the algorithm is quite easy to implement.
Measuring individual differences in implicit cognition: The implicit association test
 J PERSONALITY SOCIAL PSYCHOL 74:1464–1480
, 1998
"... An implicit association test (IAT) measures differential association of 2 target concepts with an attribute. The 2 concepts appear in a 2choice task (e.g., flower vs. insect names), and the attribute in a 2nd task (e.g., pleasant vs. unpleasant words for an evaluation attribute). When instructions ..."
Abstract

Cited by 937 (63 self)
 Add to MetaCart
An implicit association test (IAT) measures differential association of 2 target concepts with an attribute. The 2 concepts appear in a 2choice task (e.g., flower vs. insect names), and the attribute in a 2nd task (e.g., pleasant vs. unpleasant words for an evaluation attribute). When instructions
Phylogenetic identification and in situ detection of individual microbial cells without cultivation. Microbiol. Rev
, 1995
"... cultivation.of individual microbial cells without Phylogenetic identification and in situ detection ..."
Abstract

Cited by 1070 (29 self)
 Add to MetaCart
cultivation.of individual microbial cells without Phylogenetic identification and in situ detection
Genomic Expression Programs in the Response of Yeast Cells to Environmental Changes
 Mol. Biol. Cell
, 2000
"... this article contains data set material, and is available at www.molbiolcell.org. ..."
Abstract

Cited by 743 (21 self)
 Add to MetaCart
this article contains data set material, and is available at www.molbiolcell.org.
Functional discovery via a compendium of expression profiles. Cell 102:109
, 2000
"... have been devised to survey gene functions en masse either computationally (Marcotte et al., 1999) or experimentally; among these, highly parallel assays of ..."
Abstract

Cited by 537 (8 self)
 Add to MetaCart
have been devised to survey gene functions en masse either computationally (Marcotte et al., 1999) or experimentally; among these, highly parallel assays of
Using Bayesian networks to analyze expression data
 Journal of Computational Biology
, 2000
"... DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a “snapshot ” of transcription levels within the cell. A major challenge in computational biology is to uncover, from such measurements, gene/protein interactions and key biologica ..."
Abstract

Cited by 1076 (18 self)
 Add to MetaCart
DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a “snapshot ” of transcription levels within the cell. A major challenge in computational biology is to uncover, from such measurements, gene/protein interactions and key
Apoptosis: a Basic Biological Phenomenon with Wideranging Implications in Tissue Kinetics
 Br. J. Cancer
, 1972
"... Summary.The term apoptosis is proposed for a hitherto little recognized mechanism of controlled cell deletion, which appears to play a complementary but opposite role to mitosis in the regulation of animal cell populations. Its morphological features suggest that it is an active, inherently program ..."
Abstract

Cited by 612 (6 self)
 Add to MetaCart
Summary.The term apoptosis is proposed for a hitherto little recognized mechanism of controlled cell deletion, which appears to play a complementary but opposite role to mitosis in the regulation of animal cell populations. Its morphological features suggest that it is an active, inherently
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 545 (1 self)
 Add to MetaCart
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like
Results 1  10
of
1,720,418