4865 search results - page 355 / 973 » The Complexity of Graph Connectivity |
210
click to vote
DCOSS
2010
Springer
15 years 10 months ago
2010
Springer
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
196
click to vote
CAISE
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
160
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
211
click to vote
CRV
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
193
click to vote
MFCS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...