Sciweavers

113 search results - page 12 / 23
» Data structures with dynamical random transitions
Sort
View
CSREASAM
2003
13 years 11 months ago
Randomized Traitor Tracing Algorithms for Broadcast Security
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
Simon McNicol, Serdar Boztas
SGP
2004
14 years 6 days ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
VMCAI
2004
Springer
14 years 3 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
WSC
2004
13 years 11 months ago
An Experimental Study on Forecasting Using TES Processes
Forecasting is of prime importance for accuracy in decision making. For data sets containing high autocorrelations, failure to account for temporal dependence will result in poor ...
Abdullah S. Karaman, Tayfur Altiok
NSDI
2004
13 years 11 months ago
Structure Management for Scalable Overlay Service Construction
This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propo...
Kai Shen