Sciweavers

34 search results - page 4 / 7
» Embedding metric spaces in their intrinsic dimension
Sort
View
IBPRIA
2003
Springer
13 years 10 months ago
Supervised Locally Linear Embedding Algorithm for Pattern Recognition
The dimensionality of the input data often far exceeds their intrinsic dimensionality. As a result, it may be difficult to recognize multidimensional data, especially if the number...
Olga Kouropteva, Oleg Okun, Matti Pietikäinen
CCCG
2008
13 years 7 months ago
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
Christian Wulff-Nilsen
EMSOFT
2009
Springer
14 years 2 days 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
COMPGEOM
2008
ACM
13 years 7 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
14 years 2 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...