6404 search results - page 347 / 1281 » Blocks |
182
click to vote
MOC
2002
15 years 6 months ago
2002
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
145
click to vote
DM
2008
15 years 6 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
174
click to vote
DM
2008
15 years 6 months ago
2008
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
175
click to vote
ENTCS
2008
15 years 6 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
140
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—A simple cooperative diversity technique is applied to point-to-multipoint communication in wireless medium suffering from Rayleigh block fading. Such a concept is especially in...