2286 search results - page 370 / 458 » Algorithms for Categorical Equivalence |
183
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
178
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
146
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
142
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
210
click to vote
IWCMC
2009
ACM
16 years 29 days ago
2009
ACM
We propose a single carrier joint frequency domain equalization and interference cancellation (FDE-IC) with diversity combining for different relaying schemes. We consider amplif...