Sciweavers

1533 search results - page 142 / 307
» Semantic Matching: Algorithms and Implementation
Sort
View
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
14 years 3 months ago
Rank-Pairing Heaps
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
ICSE
2010
IEEE-ACM
14 years 2 months ago
Exemplar: EXEcutable exaMPLes ARchive
Searching for applications that are highly relevant to development tasks is challenging because the high-level intent reflected in the descriptions of these tasks doesn’t usual...
Mark Grechanik, Chen Fu, Qing Xie, Collin McMillan...
BMCBI
2002
120views more  BMCBI 2002»
13 years 9 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
14 years 1 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle
WWW
2005
ACM
14 years 10 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...