Sciweavers

281 search results - page 34 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 5 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
NIPS
2004
15 years 1 months ago
Adaptive Manifold Learning
Recently, there have been several advances in the machine learning and pattern recognition communities for developing manifold learning algorithms to construct nonlinear low-dimen...
Jing Wang, Zhenyue Zhang, Hongyuan Zha
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
15 years 1 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
BROADNETS
2007
IEEE
15 years 6 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 3 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...