43 search results - page 3 / 9 » On the complexity and hardness of the steganography embeddin... |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
STACS
2000
Springer
13 years 9 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
ECBS
2011
IEEE
12 years 5 months ago
2011
IEEE
—Developing dependable distributed real-time and embedded (DRE) systems incurs significant complexities in the tradeoffs resulting from the different conflicting attributes of ...
ECRTS
2002
IEEE
13 years 10 months ago
2002
IEEE
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
ECBS
2006
IEEE
13 years 11 months ago
2006
IEEE
Complex and distributed systems are more and more common. Hardware is going from strength to strength and is embedded in high performance peer-to-peer networks mostly. The task of...