Sciweavers

1220 search results - page 74 / 244
» Minimal Interval Completions
Sort
View
DSN
2007
IEEE
15 years 10 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
ATAL
2005
Springer
15 years 12 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
ICALP
2010
Springer
15 years 11 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
DATE
2005
IEEE
100views Hardware» more  DATE 2005»
15 years 12 months ago
DPA on Quasi Delay Insensitive Asynchronous Circuits: Formalization and Improvement
The purpose of this paper is to formally specify a flow devoted to the design of Differential Power Analysis (DPA) resistant QDI asynchronous circuits. The paper first proposes a ...
G. Fraidy Bouesse, Marc Renaudin, Sophie Dumont, F...
UC
2005
Springer
15 years 11 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm