Výsledky vyhľadávania - F.2.2 Nonnumerical algorithms and problems*

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions Autor Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension…”
Získať plný text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams Autor Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Získať plný text

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF Autor Beyersdorff, Olaf, Blinkhorn, Joshua, Chew, Leroy, Schmidt, Renate, Suda, Martin

“…Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF…”
Získať plný text

Mandatory Critical Points of 2D Uncertain Scalar Fields Autor Günther, David, Salmon, Joseph, Tierny, Julien

“… The algorithm provides a global pairing scheme for mandatory critical points which is used to construct mandatory join and split trees…”
Získať plný text

A method for improving full text search using signature files Autor Yamakawa, Yoshihiro, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi

“…Efficiency of full text retrieval using signatures depends on the number of filtering and the reduction of the original text, but there has been no discussion…”
Získať plný text

A link trie structure of storing multiple attribute relationships for natural language dictionaries Autor Morita, Kazuhiro, Koyama, Masafumi, Fuketa, Masao, Aoe, Jun-Ichi

“…Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge…”
Získať plný text

Radial contour labeling with straight leaders Autor Niedermann, Benjamin, Nollenburg, Martin, Rutter, Ignaz

“…The usefulness of technical drawings as well as scientific illustrations such as medical drawings of human anatomy essentially depends on the placement of…”
Získať plný text

A fast retrieval technique for large graph structures Autor Iriguchi, Hirokazu, Koyama, Masashi, Shishibori, Masami, Aoe, Jun-Ichi

“…Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their…”
Získať plný text

An algorithm for dynamic processing of dawg's Autor Park, Ki-Hong, Aoe, Jun-Ichi, Morimoto, Katsushi, Shishibori, Masami

“…SCOPE: Algorithms, Information storage and retrieval. A trie is a search tree obtained by merging the common suffixes of the key set…”
Získať plný text

Fleshing: Spine-driven Bending with Local Volume Preservation Autor Zhuo, Wei, Rossignac, Jarek

“…Several design and animation techniques use a one‐dimensional proxy C (a spine curve in 3D) to control the deformation or behavior of a digital model of a 3D…”
Získať plný text

New Bounds on the Size of Optimal Meshes Autor Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Získať plný text

Some results of the relocation problems with processing times and deadlines Autor Lin, Miao-Tsong, Tseng, Shian-Shyong

“… In the literature, an O(h * log h) algorithm has been proposed by Kaplan and Amir, where h is the number of jobs…”
Získať plný text

An optimal schedule for printing and binding Autor Chin, Francis, Wong, Michael

“… The algorithm is simpler and faster than previously known methods. If the book is divided into n parts and the typesetting time for each part is different, the algorithm takes steps…”
Získať plný text

PARADIGMS ADMITTING SUPERUNITARY BEHAVIOUR IN PARALLEL COMPUTATION Autor AKL, S. G., LINDON, L. FAVA

“…With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold…”
Získať plný text

Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories Autor Spyropoulos, C.D., Evans, D.J

“…This paper presents the extreme performance of the promising Q.A.D. algorithm, for scheduling independent jobs under few pre-set ordering rules on the examined model, when the mean-flow time is the performance criterion…”
Získať plný text

Improved grid map layout by point set matching Autor Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Získať plný text

Manifold Homotopy via the Flow Complex Autor Sadri, Bardia

“…It is known that the critical points of the distance function induced by a dense sample P of a submanifold Σ of ℝn are distributed into two groups, one lying…”
Získať plný text

Solving the traffic and flitter challenges with tulip Autor Simonetto, P., Koenig, P.-Y., Zaidi, F., Archambault, D., Gilbert, F., Trung-Tien Phan-Quang, Mathiaut, M., Lambert, A., Dubois, J., Sicre, R., Brulin, M., Vieux, R., Melancon, G.

“…We present our visualization systems and findings for the badge and network traffic as well as the social network and geospatial challenges of the 2009 VAST…”
Získať plný text

Approximate topological matching of quadrilateral meshes Autor Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.

“… Given this result, which makes an exact solution extremely unlikely, we show that the natural greedy algorithm derived from polynomial-time graph isomorphism can produce poor results, even when it…”
Získať plný text

A new approach to rectangle intersections part I Autor Edelsbrunner, Herbert

“…Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data…”
Získať plný text