Results 321 to 330 of about 4,051,827 (361)
Some of the next articles are maybe not open access.
CrossCodeEval: A Diverse and Multilingual Benchmark for Cross-File Code Completion
Neural Information Processing Systems, 2023Code completion models have made significant progress in recent years, yet current popular evaluation datasets, such as HumanEval and MBPP, predominantly focus on code completion tasks within a single file.
Yangruibo Ding +10 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
Non-Local Spatial Propagation Network for Depth Completion
European Conference on Computer Vision, 2020In this paper, we propose a robust and efficient end-to-end non-local spatial propagation network for depth completion. The proposed network takes RGB and sparse depth images as inputs and estimates non-local neighbors and their affinities of each pixel,
Jinsun Park +4 more
semanticscholar +1 more source
GRNet: Gridding Residual Network for Dense Point Cloud Completion
European Conference on Computer Vision, 2020Estimating the complete 3D point cloud from an incomplete one is a key problem in many vision and robotics applications. Mainstream methods (e.g., PCN and TopNet) use Multi-layer Perceptrons (MLPs) to directly process point clouds, which may cause the ...
Haozhe Xie +5 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