Sciweavers

2432 search results - page 48 / 487
» Degrees and choice numbers
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
15 years 2 months ago
Use of normalization methods for analysis of microarrays containing a high degree of gene effects
Background: High-throughput microarrays are widely used to study gene expression across tissues and developmental stages. Analysis of gene expression data is challenging in these ...
Terri T. Ni, William J. Lemon, Yu Shyr, Tao P. Zho...
GC
2011
Springer
14 years 9 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...
AAAI
2010
15 years 3 months ago
Lifting Rationality Assumptions in Binary Aggregation
We consider problems where several individuals each need to make a yes/no choice regarding a number of issues and these choices then need to be aggregated into a collective choice...
Umberto Grandi, Ulle Endriss
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 7 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
116
Voted
TCS
2008
15 years 1 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas