Sciweavers

562 search results - page 80 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
VISUALIZATION
1998
IEEE
15 years 1 months ago
Hierarchical volume analysis and visualization based on morphological operators
One common problem in the practical application of volume visualization is the proper choice of transfer functions in order to color different parts of the volume meaningfully. Th...
Christoph Lürig, Thomas Ertl
TON
2002
175views more  TON 2002»
14 years 9 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
ICIP
2010
IEEE
14 years 7 months ago
Spiral FFT: An efficient method for 3-D FFTS on spiral MRI contours
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
Christopher K. Turnes, Justin K. Romberg
CIKM
2008
Springer
14 years 11 months ago
Viability of in-house datamarting approaches for population genetics analysis of snp genotypes
Background: Databases containing very large amounts of SNP (Single Nucleotide Polymorphism) data are now freely available for researchers interested in medical and/or population g...
Jorge Amigo, Christopher Phillips, Antonio Salas