Sciweavers

4075 search results - page 383 / 815
» Modeling Distributed Algorithm Using B
Sort
View
TAAS
2008
70views more  TAAS 2008»
15 years 6 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
MMSEC
2004
ACM
205views Multimedia» more  MMSEC 2004»
16 years 7 days ago
Wavelet-based blind watermarking of 3D models
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
F. Uccheddu, Massimiliano Corsini, Mauro Barni
FASE
2004
Springer
15 years 10 months ago
Specification and Analysis of Real-Time Systems Using Real-Time Maude
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
Peter Csaba Ölveczky, José Meseguer
ICDCN
2011
Springer
14 years 10 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
COLT
1993
Springer
15 years 11 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung