Sciweavers

2304 search results - page 406 / 461
» On the Vulnerability of Large Graphs
Sort
View
EMNLP
2010
13 years 8 months ago
Practical Linguistic Steganography Using Contextual Synonym Substitution and Vertex Colour Coding
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
Ching-Yun Chang, Stephen Clark
IAT
2010
IEEE
13 years 8 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
IPPS
2010
IEEE
13 years 8 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...
SRDS
2010
IEEE
13 years 8 months ago
Invariants Based Failure Diagnosis in Distributed Computing Systems
This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our meth...
Haifeng Chen, Guofei Jiang, Kenji Yoshihira, Akhil...
WINE
2010
Springer
178views Economy» more  WINE 2010»
13 years 8 months ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...