Sciweavers

1307 search results - page 122 / 262
» Follow the intellectual property
Sort
View
FOCS
1995
IEEE
15 years 5 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
HYBRID
1992
Springer
15 years 5 months ago
A Formal Approach to Computer Systems Requirements Documentation
This paper demonstrates how the extended duration calculus [4] can be used to support the approach to documentation of computer systems presented by in [1]. This approach uses the ...
Marcin Engel, Marcin Kubica, Jan Madey, David Lorg...
AUSAI
2009
Springer
15 years 5 months ago
Adapting Spectral Co-clustering to Documents and Terms Using Latent Semantic Analysis
Abstract. Spectral co-clustering is a generic method of computing coclusters of relational data, such as sets of documents and their terms. Latent semantic analysis is a method of ...
Laurence A. F. Park, Christopher Leckie, Kotagiri ...
ATAL
2008
Springer
15 years 3 months ago
An Automata-Based Monitoring Technique for Commitment-Based Multi-Agent Systems
In open multi-agent systems (MASs) we cannot assume agents to be developed in a centralized fashion. Recent proposals of commitmentbased communication frameworks aim at increasing ...
Paola Spoletini, Mario Verdicchio
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 3 months ago
Communications in cellular automata
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapap...