Sciweavers

165 search results - page 19 / 33
» A New Algorithm for On-line Coloring Bipartite Graphs
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
IMCSIT
2010
13 years 5 months ago
Efficient Coloring of Wireless Ad Hoc Networks With Diminished Transmitter Power
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
Krzysztof Krzywdzinski
EACL
2009
ACL Anthology
13 years 5 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
Stephen Wan, Mark Dras, Robert Dale, Cécile...
ICPR
2008
IEEE
14 years 8 months ago
Automatic bi-layer video segmentation based on sensor fusion
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
Pierre Boulanger, Qiong Wu, Walter F. Bischof