1105 search results - page 147 / 221 » Linear choosability of graphs |
249
click to vote
PLDI
1998
ACM
15 years 11 months ago
1998
ACM
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
193
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
185
click to vote
IJCAI
2007
15 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
152
click to vote
ECCC
2010
15 years 6 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...