Sciweavers

53 search results - page 1 / 11
» Hardness of Embedding Metric Spaces of Equal Size
Sort
View
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
13 years 11 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
STACS
2007
Springer
13 years 11 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich
EMSOFT
2009
Springer
13 years 11 months ago
Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...
Kai Lampka, Simon Perathoner, Lothar Thiele
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 5 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
DAC
1999
ACM
14 years 5 months ago
Memory Exploration for Low Power, Embedded Systems
In embedded system design, the designer has to choose an onchip memory configuration that is suitable for a specific application. To aid in this design choice, we present a memory...
Wen-Tsong Shiue, Chaitali Chakrabarti