Sciweavers

COCO
2007
Springer
101views Algorithms» more  COCO 2007»
14 years 1 months ago
On Heuristic Time Hierarchies
Konstantin Pervyshev
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 1 months ago
On Parameterized Path and Chordless Path Problems
Yijia Chen, Jörg Flum
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
14 years 1 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
CEC
2007
IEEE
14 years 1 months ago
A versatile quantum-inspired evolutionary algorithm
Abstract-- This study points out some weaknesses of existing Quantum-Inspired Evolutionary Algorithms (QEA) and explains in particular how hitchhiking phenomenons can slow down the...
Michael Defoin-Platel, Stefan Schliebs, Nikola Kas...
BIRD
2007
Springer
14 years 1 months ago
Fast Search Algorithms for Position Specific Scoring Matrices
Fast search algorithms for finding good instances of patterns given as position specific scoring matrices are developed, and some empirical results on their performance on DNA sequ...
Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
ASIAN
2007
Springer
76views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Secure Verification of Location Claims with Simultaneous Distance Modification
We investigate the problem of verifying location claims of mobile devices, and propose a new property called simultaneous distance modification (SDM). In localization protocols sat...
Vitaly Shmatikov, Ming-Hsiu Wang
ASIAN
2007
Springer
129views Algorithms» more  ASIAN 2007»
14 years 1 months ago
An Integrated Model for Access Control and Information Flow Requirements
Current information systems are more and more complex. They require more interactions between different components and users. So, ensuring system security must not be limited to us...
Samiha Ayed, Nora Cuppens-Boulahia, Fréd&ea...
APPROX
2007
Springer
80views Algorithms» more  APPROX 2007»
14 years 1 months ago
Coarse Differentiation and Multi-flows in Planar Graphs
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
James R. Lee, Prasad Raghavendra