Sciweavers

8141 search results - page 200 / 1629
» Higher Order Generalization
Sort
View
CONCUR
2008
Springer
15 years 5 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
DKE
2006
109views more  DKE 2006»
15 years 3 months ago
Xandy: A scalable change detection technique for ordered XML documents using relational databases
Previous work in change detection to XML documents is not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML ...
Erwin Leonardi, Sourav S. Bhowmick
DAC
2009
ACM
16 years 4 months ago
Energy-aware error control coding for Flash memories
The use of Flash memories in portable embedded systems is ever increasing. This is because of the multi-level storage capability that makes them excellent candidates for high dens...
Veera Papirla, Chaitali Chakrabarti
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 4 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
ASM
2010
ASM
15 years 10 months ago
A Basis for Feature-Oriented Modelling in Event-B
Abstract. Feature-oriented modelling is a well-known approach for Software Product Line (SPL) development. It is a widely used method when developing groups of related software. Wi...
Jennifer Sorge, Michael Poppleton, Michael Butler