Sciweavers

967 search results - page 16 / 194
» Building a Calculus of Data Structures
Sort
View
ISCIS
2005
Springer
14 years 1 months ago
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
Margarida Mamede
ISMB
1997
13 years 9 months ago
RIBOWEB: Linking Structural Computations to a Knowledge Base of Published Experimental Data
The world wide web(WWW)has becomecritical for storing and disseminatingbiological data. It offers an additional opportunity, however,to support distributed computation and sharing...
Richard O. Chen, Ramon M. Felciano, Russ B. Altman
CSL
2004
Springer
14 years 29 days ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
TCS
2008
13 years 7 months ago
Spatial-behavioral types for concurrency and resource control in distributed systems
We develop a notion of spatial-behavioral typing suitable to discipline concurrent interactions and resource usage in distributed object systems. Our type structure reflects a res...
Luís Caires
STACS
2010
Springer
14 years 20 days ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
Neelesh Khanna, Surender Baswana