Sciweavers

1805 search results - page 25 / 361
» Functional programming with structured graphs
Sort
View
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
ICPR
2008
IEEE
14 years 2 months ago
Pattern vectors from the Ihara zeta function
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
Peng Ren, Richard C. Wilson, Edwin R. Hancock
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
14 years 2 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
COLT
2006
Springer
13 years 11 months ago
Uniform Convergence of Adaptive Graph-Based Regularization
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
Matthias Hein