Filters








7,042 Hits in 6.5 sec

R70-9 A Graph-Theoretic Model for Periodic Discrete Structures

E.L. Lawler
1970 IEEE transactions on computers  
it, to compute a new state at the given node.  ...  The late John von Neumann took an interest in a mechanical modeling of self-reproducing phenomena of living things, which are far more complex and purposeful than a mere regeneration of a facsimile of  ...  The paper concludes with the statement of a number of unsolved problems which would appear to be interesting topics for further research, e.g., find an algorithm to determine if two infinite periodic graphs  ... 
doi:10.1109/t-c.1970.222980 fatcat:be3yk2xieba3nf3wtvy2ynstsy

R70-10 The Minimalization of Tree Automata

M.A. Arbib
1970 IEEE transactions on computers  
it, to compute a new state at the given node.  ...  The late John von Neumann took an interest in a mechanical modeling of self-reproducing phenomena of living things, which are far more complex and purposeful than a mere regeneration of a facsimile of  ...  The paper concludes with the statement of a number of unsolved problems which would appear to be interesting topics for further research, e.g., find an algorithm to determine if two infinite periodic graphs  ... 
doi:10.1109/t-c.1970.222981 fatcat:xoqpbmg2wfgazes6yz3oxc5bhm

Grids versus Graphs: Partitioning Space for Improved Taxi Demand-Supply Forecasts [article]

Neema Davis, Gaurav Raina, Krishna Jagannathan
2019 arXiv   pre-print
Accurate taxi demand-supply forecasting is a challenging application of ITS (Intelligent Transportation Systems), due to the complex spatial and temporal patterns.  ...  To explore the Voronoi tessellation scheme, we propose the use of GraphLSTM (Graph-based LSTM), by representing the Voronoi spatial partitions as nodes on an arbitrarily structured graph.  ...  PROBLEM SETTING We formulate our problem as follows. For a location-based forecasting, the city space is tessellated into N regions. The Fig. 2 : Flow chart of the study in this paper.  ... 
arXiv:1902.06515v1 fatcat:x5szg2pe7fglppjidz2dlubnca

3D Shape Matching Using Skeleton Graphs

Angela Brennecke, Tobias Isenberg
2004 Simulation und Visualisierung  
As internal skeleton graphs normally do not consist of many edges, the problem of exponential time complexity due to NP completeness does not pose a problem.  ...  In addition, we present an empirical study in order to evaluate the approach by trying to match a number of example models.  ...  Thus, the complexity of the object's tessellation is successively reduced.  ... 
dblp:conf/simvis/BrenneckeI04 fatcat:6zuicn5tbbb5damlbz2kv2jcv4

A Geometry-aware Data Partitioning Algorithm for Parallel Quad Mesh Generation on Large-scale 2D Regions

Wuyi Yu, Xin Li
2015 Procedia Engineering  
First, we partition the region into a set of cells using L ∞ Centroidal Voronoi Tessellation (CVT), then we solve a graph partitioning on the dual graph of this CVT to minimize the total partitioning boundary  ...  We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for effective parallel quad meshing.  ...  Parallel algorithms utilizing high-performance computers make it possible to solve large and complex problems efficiently on hundreds or thousands of computing clusters and is therefore desirable.  ... 
doi:10.1016/j.proeng.2015.10.121 fatcat:k4f47lns4nhzpog4gb3tfwm24i

VoroCNN: Deep convolutional neural network built on 3D Voronoi tessellation of protein structures

Ilia Igashov, Liment Olechnovič, Maria Kadukova, Česlovas Venclovas, Sergei Grudinin
2021 Bioinformatics  
For the first time, we present a deep convolutional neural network (CNN) constructed on a Voronoi tessellation of 3D molecular structures.  ...  Effective use of evolutionary information has recently led to tremendous progress in computational prediction of three-dimensional (3D) structures of proteins and their complexes.  ...  Acknowledgements The authors would like to thank Elodie Laine from Sorbonne Université for the discussions during the study and proof-reading the manuscript.  ... 
doi:10.1093/bioinformatics/btab118 pmid:33620450 fatcat:t4uxwxxo5vfg3lsjwttds7ur4e

Page 2571 of Mathematical Reviews Vol. 57, Issue 6 [page]

1979 Mathematical Reviews  
We construct an automaton with a finite number of states, asymptotically opti- mal in terms of complexity, that solves the problem of distinguish- ing hypotheses.”  ...  Each cell in the tessellation structure has an associated cell in the computing struc- ture where the state of the tessellation cell is the function to be performed by the computing cell.  ... 

Practical Line Rasterization for Multi-resolution Textures [article]

Javier Taibo, Alberto Jaspe, Antonio Seoane, Marco Agus, Luis Hernández
2014 Smart Tools and Applications in Graphics  
In this paper, we address the problems of 2D line rasterization on a multi-resolution texturing engine from a pragmatical point of view; some alternative solutions are presented, compared and evaluated  ...  The study performed in this work is based on an OpenGL implementation of a clipmap-based multi-resolution texturing system, and is oriented towards the use of inexpensive consumer graphics hardware.  ...  This way of processing the polylines is far from optimal when compared to the previous method of tessellating the lines in a preprocess in the CPU.  ... 
doi:10.2312/stag.20141234 dblp:conf/egItaly/TaiboJSAH14 fatcat:pp67i33hm5hzhnzm3tiu256fte

Scalable Machine Learning Approaches for Neighborhood Classification Using Very High Resolution Remote Sensing Imagery

Manu Sethi, Yupeng Yan, Anand Rangarajan, Ranga Raju Vatsavai, Sanjay Ranka
2015 Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '15  
A semi-supervised learning approach for identifying neighborhoods is presented which employs superpixel tessellation representations of VHR imagery.  ...  The semi-supervised learning approach uses a support vector machine (SVM) to obtain a preliminary classification which is then subsequently refined using graph Laplacian propagation.  ...  Both of these algorithms are shown to perform better than most well-known SIL approaches, however leveraging them for global scale problems is difficult due to their computational complexity.  ... 
doi:10.1145/2783258.2788625 dblp:conf/kdd/SethiYRVR15 fatcat:dwign5oy4vbpvmfrganilyoxk4

R70-11 Representation of Events in the von Neumann Cellular Model

H. Yamada
1970 IEEE transactions on computers  
The first contribution of this paper is to formulate a precise definition of periodicity in terms of a graph-theoretic model originated by Yoeli.  ...  A planar tesselation is a set of polygons fitting together side by side which cover the plane simply and without gaps. A tesselation is regular if each face is the same regular polygon.  ...  The paper concludes with the statement of a number of unsolved problems which would appear to be interesting topics for further research, e.g., find an algorithm to determine if two infinite periodic graphs  ... 
doi:10.1109/t-c.1970.222982 fatcat:iptnqnfsnbccroc23ygtlw24ga

A variational quantum algorithm based on the minimum potential energy for solving the Poisson equation [article]

Yuki Sato, Ruho Kondo, Satoshi Koide, Hideki Takamatsu, Nobuyuki Imoto
2021 arXiv   pre-print
Numerical experiments demonstrate the faster computing speed of this method compared with classical computing methods and a previous variational quantum approach.  ...  Because the number of decomposed terms is independent of the size of the problem, this method requires relatively few quantum measurements.  ...  We thank Stuart Jenkinson, PhD, from Edanz Group (https://www.jp.edanz.com/ac) for editing a draft of this manuscript.  ... 
arXiv:2106.09333v1 fatcat:gdq2ayxiq5bs5i5at7l4aivemq

Simulation of Quantum Walks using HPC

P. Lara, A. Leão, R. Portugal
2016 Journal of Computational Interdisciplinary Sciences  
We describe program Hiperwalk, which is a new simulator of the main quantum walk models using high-performance computing (HPC).  ...  The simulator outputs the main statistics associated with the probability distribution of the quantum walk in data files and automatically generates plots.  ...  We acknowledge the use of ComCiDis HPC structure.  ... 
doi:10.6062/jcis.2015.06.01.0092 fatcat:tsbeocggbjeabldcl2y3jrjtli

Realtime visualization of implicit objects with contact control

Frederic Triquet, Laurent Grisoni, Philippe Meseure, Christophe Chaillou
2003 Proceedings of the 1st international conference on Computer graphics and interactive techniques in Austalasia and South East Asia - GRAPHITE '03  
Our technique is finally compared to classical marching cubes implementations, as a reference.  ...  In the framework of classical blend graph [Guy and Wyvill 1995] , a technique for handling blending is presented, based on mostly boolean operations, and hence allowing efficient implementation.  ...  For the tesselation computation, a problem occurs during the combination of marching cubes with classical deformation techniques.  ... 
doi:10.1145/604504.604508 fatcat:nj2y4h3rqfdahbisdlfamq5qna

Automated segmentation of complex patterns in biological tissues: Lessons from stingray tessellated cartilage

David Knötel, Ronald Seidel, Steffen Prohaska, Mason N. Dean, Daniel Baum, Li Zeng
2017 PLoS ONE  
Acknowledgments The authors thank Kady Lyons for providing skeletal samples for the study and Paul Zaslansky for performing the μCT scanning.  ...  This study was funded in part by an HFSP Young Investigators Grant (RGY0067-2013) to MND; MND was supported by DFG-FR 2190/4-1 Gottfried Wilhelm Leibniz-Preis 2010. Author Contributions  ...  Graph computation for manual proofreading: We iterate over all foreground voxels, which again is done in parallel on the CPU. This has a complexity of O(|F|). Parameters.  ... 
doi:10.1371/journal.pone.0188018 pmid:29236705 pmcid:PMC5728489 fatcat:atsn3ydvcndpbmw4tv4cw4rzza

Realtime visualization of implicit objects with contact control

Frederic Triquet, Laurent Grisoni, Philippe Meseure, Christophe Chaillou
2003 Proceedings of the 1st international conference on Computer graphics and interactive techniques in Austalasia and South East Asia - GRAPHITE '03  
Our technique is finally compared to classical marching cubes implementations, as a reference.  ...  In the framework of classical blend graph [Guy and Wyvill 1995] , a technique for handling blending is presented, based on mostly boolean operations, and hence allowing efficient implementation.  ...  For the tesselation computation, a problem occurs during the combination of marching cubes with classical deformation techniques.  ... 
doi:10.1145/604471.604508 dblp:conf/graphite/TriquetGMC03 fatcat:ul4bmmd5afarxpspivnvq62k5q
« Previous Showing results 1 — 15 out of 7,042 results