Sciweavers

1805 search results - page 89 / 361
» Functional programming with structured graphs
Sort
View
ASWEC
2005
IEEE
14 years 4 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
BMCBI
2007
160views more  BMCBI 2007»
13 years 11 months ago
Convergent algorithms for protein structural alignment
Background: Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually...
Leandro Martínez, Roberto Andreani, Jos&eac...
ACSC
2001
IEEE
14 years 2 months ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
ESOP
2004
Springer
14 years 4 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
PODC
2011
ACM
13 years 1 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...