Sciweavers

72 search results - page 15 / 15
» Practical approximation algorithms for zero- and bounded-ske...
Sort
View
FOCS
1995
IEEE
13 years 8 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 5 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud