4865 search results - page 470 / 973 » The Complexity of Graph Connectivity |
202
click to vote
TALG
2011
15 years 1 months ago
2011
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
199
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
205
Voted
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
185
click to vote
CBSE
2004
Springer
16 years 10 days ago
2004
Springer
: In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall ...
172
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...