نتایج جستجو برای: postorder traversal

تعداد نتایج: 4218  

2009
SARAH BAILEY FRICK

To a given finite graph we associate three kinds of adic, or BratteliVershik, systems: stationary, symbol-count, and reinforced. We give conditions for the natural walk measure to be adic-invariant and identify the ergodic adicinvariant measures for some classes of examples. If the walk measure is adicinvariant we relate its ergodic decomposition to the vector of limiting edge traversal frequen...

2016
Kailiang Ji

Resolution is a proof-search method on proving satisfiability problems. Various refinements have been proposed to improve the efficiency of this method. However, when we try to prove some graph properties, none of the refinements have an efficiency comparable with traditional graph traversal algorithms. In this paper we propose a way of solving some graph traversal problems with resolution. And...

Journal: :CoRR 2013
Yong Tan

In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover shows a new method of cutting graph. Around this model, there are six algorithms in this paper including exact graph traversal, Algebra calculation of natur...

2009
Ralf Lämmel

“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the univ operator and higher-order logic programming techniques. We pay attention to the particularities of Prolog. For instance, we deal with traversal of non-ground terms. We also develop an alternative model of SYB-like trave...

2012
Jean-Patrick Roccia Mathias Paulin Christophe Coustet

We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to efficiently distribute workload between ...

Journal: :The Open Cybernetics & Systemics Journal 2015

2006
Jiun-Rung Chen Ye-In Chang

Mining traversal patterns is one of important topics in Web mining. It focuses on how to find the Web page sequences which are frequently browsed by users. In this paper, we propose two algorithms for mining traversal patterns. For the first algorithm, SpeedTracer*-I, it is a revised version of the SpeedTracer algorithm. It directly generates and counts all candidate patterns from user sessions...

Journal: :Comput. Graph. Forum 2007
Stefan Popov Johannes Günther Hans-Peter Seidel Philipp Slusallek

Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet available from the CPUs in standard PCs. Incidentally, most of these PCs also contain modern GPUs that do offer much larger raw compute power. However, limitations in the programming and memory model have so far kept the perf...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید