Sciweavers

5473 search results - page 643 / 1095
» On the graph isomorphism problem
Sort
View
PR
2008
170views more  PR 2008»
15 years 6 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ECAI
2010
Springer
15 years 4 months ago
A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...
Thomas Voice, Ruben Stranders, Alex Rogers, Nichol...
242
Voted
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
15 years 4 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
206
Voted
TCBB
2011
15 years 1 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
204
Voted
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson