650 search results - page 67 / 130 » Positive graphs |
WEA
2009
Springer
14 years 4 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
ECML
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
IJCAI
2001
13 years 11 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
SIROCCO
2007
13 years 11 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper proposes distributed control laws for maintaining the shape of a formation of mobile autonomous agents in the plane for which the desired shape is defined in terms ...