1105 search results - page 213 / 221 » Linear choosability of graphs |
143
click to vote
INFOCOM
2009
IEEE
16 years 20 days ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
183
click to vote
FSTTCS
2009
Springer
16 years 17 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
180
Voted
SECON
2007
IEEE
16 years 8 days ago
2007
IEEE
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
159
click to vote
GECCO
2007
Springer
16 years 5 days ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
163
click to vote
ASPDAC
2006
ACM
15 years 12 months ago
2006
ACM
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...