Results 311 to 320 of about 6,430,501 (374)
Complete Characterization of the Race Scheme for Heterodera glycines.
, 1988 R. D. Riggs, D. P. Schmitt
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
How to play any mental game, or a completeness theorem for protocols with honest majority
Providing Sound Foundations for Cryptography, 2019Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is ...
O. Goldreich +2 more
semanticscholar +1 more source
Complete and Orthogonally Complete Rings
Canadian Journal of Mathematics, 1975This article continues the study of Abian's order on commutative semiprime rings (for such a ring R, the relation a ≦ b if and only if ab = a2” makes R into a partially ordered multiplicative semigroup). The aim, here, is to extend as far as possible the theorem of Brainerd and Lambek which says that the completion of a Boolean ring is its complete ...
Burgess, W. D., Raphael, R.
openaire +1 more source
Completeness Modeling and Context Separation for Weakly Supervised Temporal Action Localization
Computer Vision and Pattern Recognition, 2019Temporal action localization is crucial for understanding untrimmed videos. In this work, we first identify two underexplored problems posed by the weak supervision for temporal action localization, namely action completeness modeling and action-context ...
Daochang Liu +2 more
semanticscholar +1 more source
Completely Disconnecting the Complete Graph
SIAM Journal on Discrete Mathematics, 2000Let \(\omega \in {\mathbb{N}} \cup \{\infty\}\). By ``completely disconnecting a graph \(G\)'' the authors mean a sequence \(G= G_0, G_1, \ldots, G_t\) of spanning subgraphs of \(G\) where \(G_t\) has no edge and \(G_{i+1}\) is obtained from \(G_i\) by deleting at most \(\omega\) edges with no more than one edge being deleted from any connected ...
Ginsburg, John, Sands, Bill
openaire +1 more source
Cognitive Psychology, 1999
The visual system completes image fragments into larger regions when those fragments are taken to be the visible portions of an occluded object. Kellman and Shipley (1991) argued that this "amodal" completion is based on the way that the contours of image fragments "relate." Contours relate when their imaginary extensions intersect at an obtuse or ...
openaire +3 more sources
The visual system completes image fragments into larger regions when those fragments are taken to be the visible portions of an occluded object. Kellman and Shipley (1991) argued that this "amodal" completion is based on the way that the contours of image fragments "relate." Contours relate when their imaginary extensions intersect at an obtuse or ...
openaire +3 more sources