Sciweavers

1805 search results - page 19 / 361
» Functional programming with structured graphs
Sort
View
APBC
2003
138views Bioinformatics» more  APBC 2003»
13 years 9 months ago
A New Approach to Protein Structure and Function Analysis Using Semi-structured Databases
The development of high-throughput genome sequencing and protein structure determination techniques have provided researchers with a wealth of biological data. Integrated analysis...
William M. Shui, Raymond K. Wong, Stephen C. Graha...
BMCBI
2006
195views more  BMCBI 2006»
13 years 7 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
ECEASST
2010
13 years 5 months ago
Conditional Adaptive Star Grammars
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
Berthold Hoffmann
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel