145 search results - page 28 / 29 » On finding approximate optimal paths in weighted regions |
ISPD
2000
ACM
13 years 10 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
CGF
2008
13 years 6 months ago
2008
Teaser Figure: Left: Brain, visualized using silhouettes, the lesion's spatial depth is displayed using a ring. Center: Combined rendering of brain tissue, skull and fiber tr...
SSD
2007
Springer
14 years 3 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
MOR
2008
13 years 6 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
HICSS
2010
IEEE
13 years 8 months ago
2010
IEEE
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...