Sciweavers

11212 search results - page 201 / 2243
» Semi-persistent Data Structures
Sort
View
DCC
2010
IEEE
16 years 1 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Simon Gog, Johannes Fischer
TAPSOFT
1997
Springer
15 years 10 months ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May
BROADNETS
2004
IEEE
15 years 10 months ago
Structures for In-Network Moving Object Tracking in Wireless Sensor Networks
One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storag...
Chih-Yu Lin, Yu-Chee Tseng
EDOC
2006
IEEE
15 years 10 months ago
Combining Analysis of Unstructured Workflows with Transformation to Structured Workflows
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...
Rainer Hauser, Michael Friess, Jochen Malte Kü...
ICPR
2010
IEEE
15 years 9 months ago
Kernel-Based Implicit Regularization of Structured Objects
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
François-Xavier Dupé, Sébastien Bougleux, Luc B...