Results 1 to 10 of about 41,813 (154)
Out of the Cube: Augmented Rubik's Cube [PDF]
Computer gaming habits have a tendency to evolve with technology, the best being ones that immerse both our imagination and intellect. Here, we describe a new game platform, an Augmented Reality Rubik's cube.
Oriel Bergig +7 more
doaj +2 more sources
On regular subgraphs of augmented cubes [PDF]
The n-dimensional augmented cube AQn is a variation of the hypercube It is a -regular and -connected graph on vertices. One of the fundamental properties of AQn is that it is pancyclic, that is, it contains a cycle of every length from 3 to In this paper,
Amruta Shinde, Y. M. Borse
doaj +2 more sources
E-Sem3DGS: Monocular Human and Scene Reconstruction via Event-Aided Semantic 3DGS [PDF]
Reconstructing animatable humans, together with their surrounding static environments, from monocular, motion-blurred videos is still challenging for current neural rendering methods.
Xiaoting Yin +5 more
doaj +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang, Y., Stewart, I. A.
+10 more sources
The Conditional Strong Matching Preclusion of Augmented Cubes
The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or ...
Mohamad Abdallah, Eddie Cheng
doaj +1 more source
Merge Cube as a New Teaching Tool for Augmented Reality
Due to the massive popularity of smartphones among people of all ages, Augmented Reality is becoming a commonly available technology for which we do not need to have special equipment, just an ordinary cheap smartphone with a camera.
Patrik Vostinar, Patrik Ferianc
doaj +1 more source
Pendant 3-Tree Connectivity of Augmented Cubes
Abstract The Steiner tree problems in graphs attended widely because of its applications in network design or circuit layout. Given a set $S$ of vertices, $|S| \geq 2,$ a tree connecting all vertices of $S$ is called an $S$-Steiner tree (tree connecting $S$). The reliability of a network $G$ to connect any $S$ vertices ($|S|$ number of vertices)
Mane, S. A., Kandekar, S. A.
openaire +2 more sources
Guru IPA di Kabupaten Batang masih banyak yang mengalami kendala dalam kenaikan pangkat. Penyebabnya adalah guru mengalami kesulitan memenuhi persyaratan dari sisi karya inovatif unsur PKB (Pengembangan Keprofesian Berkelanjutan).
Muhamad Taufiq +3 more
doaj +1 more source
The optimal routing of augmented cubes [PDF]
A routing in a graph G is a set of paths connecting each ordered pair of vertices. Load of an edge e is the number of times it appears on these paths. The edge-forwarding index of G is the smallest of maximum loads over all routings. Augmented cube of dimension n, AQ n , is the Cayley graph (Z n 2 , {e 1 , e 2 ,. .. , e n , J 2 ,. .. , J n }) where e i
Chen, Meirun, Naserasr, Reza
openaire +3 more sources
The Cube Surface Light Field for Interactive Free-Viewpoint Rendering
Free-viewpoint rendering has always been one of the key motivations of image-based rendering and has broad application prospects in the field of virtual reality and augmented reality (VR/AR).
Xiaofei Ai, Yigang Wang
doaj +1 more source

