Sciweavers

1172 search results - page 129 / 235
» Path Algorithms on Regular Graphs
Sort
View
148
Voted
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
15 years 8 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
GISCIENCE
2008
Springer
140views GIS» more  GISCIENCE 2008»
15 years 6 months ago
Modeling Herds and Their Evolvements from Trajectory Data
A trajectory is the time-stamped path of a moving entity through space. Given a set of trajectories, this paper proposes new conceptual definitions for a spatio-temporal pattern n...
Yan Huang, Cai Chen, Pinliang Dong
EMMCVPR
2001
Springer
15 years 9 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
IJBIDM
2010
80views more  IJBIDM 2010»
15 years 3 months ago
Practical algorithms for subgroup detection in covert networks
: In this paper, we present algorithms for subgroup detection and demonstrated them with a real-time case study of USS Cole bombing terrorist network. The algorithms are demonstrat...
Nasrullah Memon, Uffe Kock Wiil, Abdul Rasool Qure...
WINET
2010
128views more  WINET 2010»
15 years 3 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...