3757 search results - page 535 / 752 » The overlap number of a graph |
169
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
148
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
182
click to vote
INFOCOM
2008
IEEE
16 years 28 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
192
click to vote
CIBCB
2007
IEEE
16 years 26 days ago
2007
IEEE
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
167
click to vote
GLVLSI
2007
IEEE
16 years 26 days ago
2007
IEEE
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...