Sciweavers

1594 search results - page 73 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
EMMCVPR
2007
Springer
15 years 7 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
ISCAS
2005
IEEE
149views Hardware» more  ISCAS 2005»
15 years 8 months ago
Advances in QoS path(s) selection problem
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
Krishnaiyan Thulasiraman, Ying Xiao, Guoliang Xue
ADHOCNOW
2008
Springer
15 years 9 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
IJRR
2007
104views more  IJRR 2007»
15 years 2 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
ICCV
2007
IEEE
16 years 5 months ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother