Sciweavers

11211 search results - page 414 / 2243
» Rank-Sensitive Data Structures
Sort
View
RECOMB
2001
Springer
16 years 7 months ago
Predicting the beta-helix fold from protein sequence data
A method is presented that uses b-strand interactions to predict the parallel right-handed b-helix super-secondary structural motif in protein sequences. A program called BetaWrap...
Phil Bradley, Lenore Cowen, Matthew Menke, Jonatha...
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
15 years 11 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
VMV
2001
168views Visualization» more  VMV 2001»
15 years 8 months ago
High-quality Volume Rendering of Adaptive Mesh Refinement Data
Adaptive mesh refinement (AMR) is a numerical simulation technique used in computational fluid dynamics (CFD). By using a set of nested grids of different resolutions, AMR combine...
Gunther H. Weber, Oliver Kreylos, Terry J. Ligocki...
ECCC
2007
144views more  ECCC 2007»
15 years 6 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
COMPGEOM
1999
ACM
15 years 11 months ago
The Path of a Triangulation
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
Oswin Aichholzer