Sciweavers

1986 search results - page 366 / 398
» Path Separability of Graphs
Sort
View
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
VEE
2012
ACM
255views Virtualization» more  VEE 2012»
12 years 3 months ago
Adding dynamically-typed language support to a statically-typed language compiler: performance evaluation, analysis, and tradeof
Applications written in dynamically typed scripting languages are increasingly popular for Web software development. Even on the server side, programmers are using dynamically typ...
Kazuaki Ishizaki, Takeshi Ogasawara, José G...
SPAA
2012
ACM
11 years 10 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
GIS
2009
ACM
14 years 8 months ago
From GPS Traces to a Routable Road Map
This paper presents a method for automatically converting raw GPS traces from everyday vehicles into a routable road network. The method begins by smoothing raw GPS traces using a...
Lili Cao, John Krumm
GIS
2005
ACM
14 years 8 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar