Sciweavers

6939 search results - page 965 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
15 years 11 months ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
DEDS
2006
119views more  DEDS 2006»
15 years 6 months ago
Diagnosability of Discrete Event Systems with Modular Structure
The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diag...
Olivier Contant, Stéphane Lafortune, Demost...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 6 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
ICC
2009
IEEE
279views Communications» more  ICC 2009»
16 years 1 months ago
Non-Regenerative Multicarrier MIMO Relay Communications Based on Minimization of Mean-Squared Error
Abstract—In this paper we propose non-regenerative multicarrier multiple-input multiple-output (MIMO) relay techniques that minimize the mean-squared error (MSE) of the signal wa...
Yue Rong
EUROPAR
2007
Springer
16 years 17 days ago
A First Step Towards Automatically Building Network Representations
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...
Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quins...