Sciweavers

4536 search results - page 51 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ESWS
2006
Springer
13 years 11 months ago
An Iterative Algorithm for Ontology Mapping Capable of Using Training Data
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
Andreas Heß
ICML
2007
IEEE
14 years 8 months ago
Learning for efficient retrieval of structured data with noisy queries
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
Charles Parker, Alan Fern, Prasad Tadepalli
RECOMB
2001
Springer
14 years 5 days ago
Extracting structural information using time-frequency analysis of protein NMR data
High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and fu...
Christopher James Langmead, Bruce Randall Donald
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
14 years 1 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 7 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...