113 search results - page 19 / 23 » Solving Boolean Equations Using ROSOP Forms |
ICDT
2010
ACM
15 years 2 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
103
click to vote
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eige...
117
click to vote
TIM
2010
14 years 4 months ago
2010
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
CGF
1998
14 years 9 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
110
click to vote
SAS
1994
Springer
15 years 2 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...