549 search results - page 66 / 110 » Computing All the Best Swap Edges Distributively |
CICLING
2010
Springer
15 years 4 months ago
2010
Springer
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
TCS
2008
14 years 9 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
104
click to vote
PR
2008
14 years 8 months ago
2008
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...