Sciweavers

11213 search results - page 105 / 2243
» Low-contention data structures
Sort
View
GFKL
2004
Springer
137views Data Mining» more  GFKL 2004»
15 years 9 months ago
Density Estimation and Visualization for Data Containing Clusters of Unknown Structure
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
Alfred Ultsch
143
Voted
BMCBI
2008
103views more  BMCBI 2008»
15 years 3 months ago
Discovering multi-level structures in bio-molecular data through the Bernstein inequality
Background: The unsupervised discovery of structures (i.e. clusterings) underlying data is a central issue in several branches of bioinformatics. Methods based on the concept of s...
Alberto Bertoni, Giorgio Valentini
98
Voted
ICDE
2010
IEEE
494views Database» more  ICDE 2010»
16 years 3 months ago
Hashing Tree-Structured Data: Methods and Applications
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...
Shirish Tatikonda, Srinivasan Parthasarathy
BMCBI
2006
59views more  BMCBI 2006»
15 years 3 months ago
Novel methods for secondary structure determination using low wavelength (VUV) circular dichroism spectroscopic data
Background: Circular Dichroism (CD) spectroscopy is a widely used method for studying protein structures in solution. Modern synchrotron radiation CD (SRCD) instruments have consi...
Jonathan G. Lees, Andrew J. Miles, Robert W. Janes...
STACS
2010
Springer
15 years 10 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf