Sciweavers

1105 search results - page 181 / 221
» Linear choosability of graphs
Sort
View
NC
2010
137views Neural Networks» more  NC 2010»
14 years 4 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
15 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
IWCIA
2009
Springer
15 years 4 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
COR
2010
123views more  COR 2010»
14 years 10 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
JNW
2006
126views more  JNW 2006»
14 years 9 months ago
Gateway Deployment optimization in Cellular Wi-Fi Mesh Networks
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
Rajesh Prasad, Hongyi Wu