5606 search results - page 561 / 1122 » Randomization Techniques for Graphs. |
199
click to vote
WSC
1997
15 years 8 months ago
1997
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
182
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
166
click to vote
BIB
2007
15 years 7 months ago
2007
Bayesian methods are valuable, inter alia, whenever there is a need to extract information from data that is uncertain or subject to any kind of error or noise (including measurem...
178
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Expression microarrays represent a powerful technique for the simultaneous investigation of thousands of genes. The evidence that genes are not randomly distributed in...
256
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...