Sciweavers

11213 search results - page 4 / 2243
» Low-contention data structures
Sort
View
SBMF
2010
Springer
149views Formal Methods» more  SBMF 2010»
13 years 4 months ago
Reasoning about Assignments in Recursive Data Structures
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
Alejandro Tamalet, Ken Madlener
CJ
1998
118views more  CJ 1998»
13 years 9 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
IPL
2010
94views more  IPL 2010»
13 years 8 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 9 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
AO
2011
112views more  AO 2011»
13 years 4 months ago
The RNA Ontology (RNAO): An ontology for integrating RNA sequence and structure data
Biomedical Ontologies are intended to integrate diverse biomedical data to enable intelligent datamining and facilitate translation of basic research into useful clinical knowledg...
Robert Hoehndorf, Colin R. Batchelor, Thomas Bittn...