Sciweavers

4536 search results - page 165 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Dynamic parallelization for RNA structure comparison
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
Eric Snow, Eric Aubanel, Patricia Evans
APWEB
2004
Springer
14 years 2 months ago
Improving XML Query Performance Using Social Classes
In a state-of-the-art XML database, an XML query is evaluated as a sequence of structural joins in which positions of data nodes are used to perform each individual structural joi...
Weining Zhang, Douglas Pollok
JACM
2000
131views more  JACM 2000»
13 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
ICML
2009
IEEE
14 years 10 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
COCOON
2009
Springer
14 years 3 months ago
Determination of Glycan Structure from Tandem Mass Spectra
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
Sebastian Böcker, Birte Kehr, Florian Rasche