Sciweavers

845 search results - page 127 / 169
» Diagnosabilities of regular networks
Sort
View
IPPS
1998
IEEE
14 years 5 days ago
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
TREC
2001
13 years 9 months ago
The QUANTUM Question Answering System
We participated to the TREC-X QA main task and list task with a new system named QUANTUM, which analyzes questions with shallow parsing techniques and regular expressions. Instead...
Luc Plamondon, Guy Lapalme, Leila Kosseim
SNPD
2003
13 years 9 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
ACTA
2010
104views more  ACTA 2010»
13 years 8 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
IJNSEC
2008
108views more  IJNSEC 2008»
13 years 8 months ago
Multiplicative Forward-Secure Threshold Signature Scheme
The devastating consequence of secret key exposure in digital signature is that any signature can be forged and cannot be trusted. To mitigate the damage of secret key exposure, f...
Sherman S. M. Chow, H. W. Go, Lucas Chi Kwong Hui,...