Sciweavers

3680 search results - page 214 / 736
» cases 2010
Sort
View
ECCC
2007
90views more  ECCC 2007»
15 years 6 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
RFIDSEC
2010
15 years 5 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
JUCS
2010
159views more  JUCS 2010»
15 years 1 months ago
Developing a Secure Mobile Grid System through a UML Extension
: The idea of developing software through systematic development processes to improve software quality is not new. Nevertheless, there are still many information systems such as th...
David G. Rosado, Eduardo Fernández-Medina, ...
PROMISE
2010
15 years 1 months ago
Case-based reasoning vs parametric models for software quality optimization
Background: There are many data mining methods but few comparisons between them. For example, there are at least two ways to build quality optimizers, programs that find project o...
Adam Brady, Tim Menzies
TCAD
2010
136views more  TCAD 2010»
15 years 1 months ago
Bounded Model Debugging
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
Brian Keng, Sean Safarpour, Andreas G. Veneris