Sciweavers

763 search results - page 99 / 153
» Engineering Shortest Path Algorithms
Sort
View
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 4 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
WOWMOM
2009
ACM
128views Multimedia» more  WOWMOM 2009»
14 years 4 months ago
A queuing modeling approach for Load-Aware Route Selection in heterogeneous mesh networks
Wireless mesh networks are primarily used to provide Internet access by sharing the Internet connections of a limited number of gateways. If traffic is routed in the mesh without...
Raffaele Bruno, Marco Conti, Antonio Pinizzotto
MATES
2010
Springer
13 years 8 months ago
Context-Aware Route Planning
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
Adriaan ter Mors, Cees Witteveen, Jonne Zutt, Fern...
TWC
2011
291views more  TWC 2011»
13 years 4 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...