4302 search results - page 267 / 861 » Index Pairs Algorithms |
156
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
127
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
165
click to vote
PDPTA
1996
15 years 5 months ago
1996
An important research topic in image processing is stereo vision. The objective is to compute a 3-dimensional representation of some scenery from two 2-dimensional digital images....
136
click to vote
IJFCS
2006
15 years 4 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
120
click to vote
CIDM
2009
IEEE
15 years 11 months ago
2009
IEEE
– Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the we...