706 search results - page 20 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ICIP
2003
IEEE
14 years 26 days ago
2003
IEEE
We have been developing new relevance feedback algorithms for Content-based Image Retrieval (CBIR) that allow the user to achieve more flexible query. In conjunction with the new...
COCOA
2011
Springer
12 years 7 months ago
2011
Springer
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
ICPPW
2002
IEEE
14 years 16 days ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
TKDE
2008
13 years 7 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...