146 Hits in 7.5 sec

Page 2570 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Mirkowska (Pau) 98d:68145 68Q68 68Q42 68Q70 Danyi, Gabor (H-SZEG-FC; Szeged) On domain and range tree languages of superlinear deterministic top-down tree transformations.  ...  Furthermore, the paper presents an algorithm for deciding whether a deterministic top-down tree language is the domain of a superlinear deterministic transformation.  ... 

The Generating Power of Total Deterministic Tree Transducers

Sebastian Maneth
1998 Information and Computation  
To prove this, a number of results concerning the generating power of top-down tree transducers are established, which are interesting in their own.  ...  One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context-free  ...  I am grateful to Joost Engelfriet for the tremendous amount of helpful comments and suggestions for improvements on an earlier version of this paper.  ... 
doi:10.1006/inco.1998.2736 fatcat:bpji5u4kabcyxpgbxsptcr7ka4

Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity [article]

Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
2019 arXiv   pre-print
Their output tree languages are deterministic context-sensitive, i.e., can be recognized in deterministic linear space on a Turing machine.  ...  Second, every composition of deterministic transducers can be computed in deterministic linear time on a RAM and in deterministic linear space on a Turing machine, measured in the sum of the sizes of the  ...  The range of a deterministic tt M can be restricted to a regular tree language L by restricting its domain to τ −1 M (L), using Lemmas 9 and 13.  ... 
arXiv:1904.09203v3 fatcat:wmhkob2curhnba6hefynpsx6da

Reowolf 1.0 Project Code and Documentation [article]

Christopher A. Esterhuyse, Hans-Dieter A. Hiep
2020 Zenodo  
A copy of the source code repository of version v1.0.0, and an overview presentation and its slides, are included. This repository comprises the final deliverables of the Reowolf 1.0 project.  ...  This repository serves as the documentation and specification of the Reowolf project, aiming to provide connectors as a generalization of BSD-sockets for multi-party communication over the Internet.  ...  This chapter describes the implementation of backwards compatibility, and provides a concrete example of applications built on top of pseudo-sockets in the C language. 4.  ... 
doi:10.5281/zenodo.4160607 fatcat:ru22q2jfxfdqfk67wn4vfoiwxq

Making deterministic signatures quickly

Milan Ružić
2009 ACM Transactions on Algorithms  
Representative results are: a dictionary with a lookup time of O(log log n) and construction time of O(n) on sorted input on a Word RAM, and a static predecessor structure for variable and unbounded length  ...  All algorithms and data structures are deterministic and use linear space.  ...  ACKNOWLEDGMENTS The author wishes to thank: Mihai Pǎtraşcu for interesting and helpful discussions on this subject, and in particular for pointing out that dot product with a constant vector can be easily  ... 
doi:10.1145/1541885.1541887 fatcat:vasu3njvvjfpddpxqsexb5rwdq

External memory algorithms and data structures: dealing with massive data

Jeffrey Scott Vitter
2001 ACM Computing Surveys  
For the batched problem of sorting and related problems such as permuting and fast Fourier transform, the key paradigms include distribution and merging.  ...  In this article we survey the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs  ...  Figures 6, 7, 9 , 10, 12, and 13 are modified versions of figures in Arge et al. [1998a] Enbody and Du [1998], Kanellakis et al. [1996] , Arge et al. [1999a,b], and Ferragina and Grossi [1999] , respectively  ... 
doi:10.1145/384192.384193 fatcat:tunz4fa3rrgv7hwbk7qsvahd5i

On the virtue of succinct proofs

Trinh Huynh, Jakob Nordstrom
2012 Proceedings of the 44th symposium on Theory of Computing - STOC '12  
We use this paradigm of hardness amplification to make progress on the relatively longstanding open question of proving time-space trade-offs for PC and CP.  ...  Inspired by [BN08, BN11], we consider CNF encodings of so-called pebble games played on graphs and the approach of making such pebbling formulas harder by simple syntactic modifications.  ...  Acknowledgements The first author performed part of this work while visiting KTH Royal The authors would like to thank Arkadev Chattopadhyay for several enjoyable (and above all illuminating) discussions  ... 
doi:10.1145/2213977.2214000 dblp:conf/stoc/HuynhN12 fatcat:il3fpwscg5crjle2mnnbm3jihq

Boltzmann Samplers for the Random Generation of Combinatorial Structures

2004 Combinatorics, probability & computing  
If one identifies size of a combinatorial configuration with energy of a thermodynamical system and sets x = e −β , then what we term the ordinary Boltzmann models become the usual model of statistical  ...  This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models.  ...  More generally, the method applies to any regular language: it suffices to convert a description of the language into a deterministic finite automaton and apply the recursive construction of a sampler,  ... 
doi:10.1017/s0963548304006315 fatcat:arn7z5paojavpnayykqhz5kkvu

Parallel execution of prolog programs: a survey

Gopal Gupta, Enrico Pontelli, Khayri A.M. Ali, Mats Carlsson, Manuel V. Hermenegildo
2001 ACM Transactions on Programming Languages and Systems  
The objective of this article is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in  ...  The article describes the major techniques used for shared memory implementation of Or-parallelism, And-parallelism, and combinations of the two.  ...  on the way down.  ... 
doi:10.1145/504083.504085 fatcat:7dms2hz5mzdsjezpgu2jnf4dsa

CUBES: A Parallel Synthesizer for SQL Using Examples [article]

Ricardo Brancas, Miguel Terra-Neves, Miguel Ventura, Vasco Manquinho, Ruben Martins
2022 arXiv   pre-print
We perform an extensive evaluation on around 4000 SQL queries from different domains.  ...  In recent years, more and more people see their work depend on data manipulation tasks.  ...  Cubes is built on top of an open-source sequential query synthesizer [20] , which we further improved by extending the language of queries supported by Cubes and by adding pruning techniques that can  ... 
arXiv:2203.04995v1 fatcat:ira3zshakjd5vhof5i6shcapxm

Algorithms and Data Structures for External Memory

Jeffrey Scott Vitter
2006 Foundations and Trends® in Theoretical Computer Science  
The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing.  ...  Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality  ...  [333] independently devised fast bulk loading methods based upon buffer trees that do top-down construction in O(n log m n) I/Os, which matches the performance of Table 12 .1, we report on some experiments  ... 
doi:10.1561/0400000014 fatcat:bkfchugd4fbjvcu5zipnh23k6e

Generic top-down discrimination for sorting and partitioning in linear time

2012 Journal of functional programming  
on representations of ordering and equivalence relations.  ...  Full source code of discriminators and their applications is included.  ...  Disclaimer This paper emphasizes the compositional programming aspects of top-down generic discrimination.  ... 
doi:10.1017/s0956796812000160 fatcat:3d2q22spfbbslegppedp56c4ju

Replicable parallel branch and bound search

Blair Archibald, Patrick Maier, Ciaran McCreesh, Robert Stewart, Phil Trinder
2018 Journal of Parallel and Distributed Computing  
Their performance often depends on good search order heuristics, refined over decades of algorithms research.  ...  The overheads of our Haskell skeleton are reasonable: giving slowdown factors of between 1.9 and 6.2 compared with a class-leading, dedicated, and highly optimised C++ Maximum Clique solver.  ...  Acknowledgements This work is funded by UK EPSRC grants AJITPar (EP/L000687), CoDiMa (EP/M022641), Glasgow DTA (EP/K503058), MaRIONet (EP/P006434), Rathlin (EP/K009931) and Border Patrol (EP/N028201/1)  ... 
doi:10.1016/j.jpdc.2017.10.010 fatcat:hufm3ldyqrarhcnne65flqpkem

Data Enrichment [chapter]

2017 Encyclopedia of Machine Learning and Data Mining  
Decision trees and decision lists are two popular hypothesis languages, which share quite a few similarities, but also have important differences with respect to expressivity and learnability.  ...  Data preparation is the process of manipulating and organizing data prior to analysis.  ...  Learning Algorithm Decision trees are learned in a top-down fashion, with an algorithm known as top-down induction of decision trees (TDIDT), recursive partitioning, or divide-and-conquer learning.  ... 
doi:10.1007/978-1-4899-7687-1_979 fatcat:v22x3o5iuzaa5ghwx5fvqztpg4

Page 1584 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(English summary) (see 98d:68019) Danyi, Gabor On domain and range tree languages of superlinear deterministic top-down tree transformations.  ...  (English summary) 984:68145 — (with Fiilép, Zoltan) Compositions with superlinear deterministic top-down tree transformations.  ... 
« Previous Showing results 1 — 15 out of 146 results