Sciweavers

715 search results - page 93 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
AAAI
2006
13 years 10 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
COMSWARE
2006
IEEE
14 years 2 months ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
BMCBI
2005
180views more  BMCBI 2005»
13 years 8 months ago
arrayCGHbase: an analysis platform for comparative genomic hybridization microarrays
Background: The availability of the human genome sequence as well as the large number of physically accessible oligonucleotides, cDNA, and BAC clones across the entire genome has ...
Björn Menten, Filip Pattyn, Katleen De Preter...
INFOCOM
1995
IEEE
14 years 10 days ago
Automatic Alarm Correlation for Fault Identification
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
Isabelle Rouvellou, George W. Hart
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 9 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...