Sciweavers

1938 search results - page 149 / 388
» On Positive Relational Calculi
Sort
View
DM
2010
102views more  DM 2010»
13 years 9 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
EJC
2008
13 years 9 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
BMCBI
2006
124views more  BMCBI 2006»
13 years 9 months ago
Predicting transcription factor binding sites using local over-representation and comparative genomics
Background: Identifying cis-regulatory elements is crucial to understanding gene expression, which highlights the importance of the computational detection of overrepresented tran...
Matthieu Defrance, Hélène Touzet
CPC
2006
110views more  CPC 2006»
13 years 9 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
IJSNET
2006
170views more  IJSNET 2006»
13 years 9 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong