Sciweavers

397 search results - page 52 / 80
» Local embeddings of metric spaces
Sort
View
JUCS
2002
79views more  JUCS 2002»
13 years 8 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka
CVPR
2007
IEEE
14 years 10 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
IMC
2006
ACM
14 years 2 months ago
A structural approach to latency prediction
Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure...
Harsha V. Madhyastha, Thomas E. Anderson, Arvind K...
LION
2009
Springer
203views Optimization» more  LION 2009»
14 years 3 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
PAMI
2006
141views more  PAMI 2006»
13 years 8 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee