Sciweavers

3852 search results - page 478 / 771
» Construction of Codes for Network Coding
Sort
View
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
16 years 3 days ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
ICESS
2004
Springer
16 years 2 days ago
Relating FFTW and Split-Radix
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
Oleg Kiselyov, Walid Taha
OTM
2004
Springer
16 years 2 days ago
MSF: A Workflow Service Infrastructure for Computational Grid Environments
Globus has become a standard in the construction of Grid computing environments. However, it still needs more work and research to satisfy requirements from various grid applicatio...
Seogchan Hwang, Jaeyoung Choi
VMCAI
2004
Springer
16 years 1 days 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...
COMPSAC
2003
IEEE
16 years 13 hour ago
Automating Checking of Models Built Using a Graphically Based Formal Modelling Language
RDT is a graphical formal modelling language in which the modeller works by constructing diagrams of the processes in their model which they then join together to form complete sy...
Robert John Walters