Filters








5,700 Hits in 5.3 sec

Data Oblivious Algorithms for Multicores [article]

Vijaya Ramachandran, Elaine Shi
2021 arXiv   pre-print
We also present results for several applications including list ranking, Euler tour, tree contraction, connected components, and minimum spanning forest.  ...  Using our sorting algorithm as a core primitive, we show how to data-obliviously simulate general PRAM algorithms in the binary fork-join model with non-trivial efficiency.  ...  Make a reverse of each edge, e.g., the reverse of (u, v) is (v, u). 2.  ... 
arXiv:2008.00332v2 fatcat:fpj5e7tqjfbe7audobaqj7xv3y

Context-free hypergraph grammars have the same term-generating power as attribute grammars

Joost Engelfriet, Linda Heyker
1992 Acta Informatica  
Context-free hypergraph grammars and attribute grammars generate the same class of term languages.  ...  The remarks of the referees have been very helpful in writing the conclusion.  ...  Every X~No is a nonterminal of G' of rank #Att(X); in particular, So is the initial nonterminal of G' (with rank 1). These nonterminals will be used to simulate the derivation trees of Go.  ... 
doi:10.1007/bf01178504 fatcat:spgr3hfupzdchnqlxopuf6wnru

A Machine Learning Platform to Optimize the Translation of Personalized Network Models to the Clinic

Manuela Salvucci, Arman Rahman, Alexa J. Resler, Girish M. Udupi, Deborah A. McNamara, Elaine W. Kay, Pierre Laurent-Puig, Daniel B. Longley, Patrick G. Johnston, Mark Lawler, Richard Wilson, Manuel Salto-Tellez (+5 others)
2019 JCO Clinical Cancer Informatics  
However, the personalization of model predictions requires the profiling of multiple model inputs, which hampers clinical translation.  ...  -rank P = .002 v log-rank P = .004 v HR, 3.82 (95% CI, 1.45 to 10.Validation of minimal models for APOPTO-CELL with reverse phase protein array-based measurements in an in-house cohort of patients with  ...  We trained a binary classification decision tree (Tree) on the 3,200,000 virtual patients using protein concentrations as input features and the ground-truth APOPTO-CELL START SMAC SMAC < 50th 50th  ... 
doi:10.1200/cci.18.00056 pmid:30995124 fatcat:hn34r7o7yfegva3jrvfy7napzu

Tight lower bounds for query processing on streaming and external memory data

Martin Grohe, Christoph Koch, Nicole Schweikardt
2007 Theoretical Computer Science  
In the present paper we study a clean machine model for external memory and stream processing. We establish tight bounds for the data complexity of Core XPath evaluation and filtering.  ...  of size o(n).  ...  ) : T ∈ T } of associated binary trees is recognizable by an ordinary (ranked) tree automaton (cf., e.g., [8, 10, 41, 42] ).  ... 
doi:10.1016/j.tcs.2007.02.062 fatcat:464zqps3snbyzgcxiiy5udu4zu

Tight Lower Bounds for Query Processing on Streaming and External Memory Data [chapter]

Martin Grohe, Christoph Koch, Nicole Schweikardt
2005 Lecture Notes in Computer Science  
In the present paper we study a clean machine model for external memory and stream processing. We establish tight bounds for the data complexity of Core XPath evaluation and filtering.  ...  of size o(n).  ...  ) : T ∈ T } of associated binary trees is recognizable by an ordinary (ranked) tree automaton (cf., e.g., [8, 10, 41, 42] ).  ... 
doi:10.1007/11523468_87 fatcat:4fifn2ejffaktmbbcwxm22nk74

Tight Lower Bounds for Query Processing on Streaming and External Memory Data [article]

Martin Grohe, Christoph Koch, Nicole Schweikardt
2005 arXiv   pre-print
We study a clean machine model for external memory and stream processing.  ...  of size o(√(n)).  ...  T } of associated binary trees is recognizable by an ordinary (ranked) tree automaton (cf., e.g., [7, 9, 30] ).  ... 
arXiv:cs/0505002v1 fatcat:2frqxkyxszc4xnhpfgjwou5cme

Synergistic Benefits of Group Search in Rats

Máté Nagy, Attila Horicsányi, Enikő Kubinyi, Iain D. Couzin, Gábor Vásárhelyi, Andrea Flack, Tamás Vicsek
2020 Current Biology  
One classical experimental search task, informing studies of navigation, memory, and learning, is the location of a reward in a confined, complex maze setting [7, 8].  ...  Using automated video tracking, we find that rats exhibit-even when alone-a partially systematic search, leading to a continuous increase in their chance of finding the reward because of increased attraction  ...  Experimental Setup Consisting of Repeated Y-Maze Tunnels Organized as a Hierarchical Binary Tree Network with Symmetrical 120 Junctions (A) Hierarchical binary tree with 4 decision points and 16 endpoints  ... 
doi:10.1016/j.cub.2020.08.079 pmid:32976805 fatcat:zodipawfdbf7tfwvtyo32nlrhu

Non-reference audio quality assessment for online live music recordings

Zhonghua Li, Ju-Chiang Wang, Jingli Cai, Zhiyan Duan, Hsin-Min Wang, Ye Wang
2013 Proceedings of the 21st ACM international conference on Multimedia - MM '13  
Results show that our framework significantly improves the ranking performance of live music recording retrieval and can prove useful for various real-world music applications.  ...  The first dataset contains 500 human-annotated pieces, and the second contains 2,400 synthetic pieces systematically generated by adding noise effects to clean recordings.  ...  Ranking labels are assigned as the reverse of the ranking order within the query song group so that the label of the best-quality version (rank 1) has the highest assigned value (5 for ADB-H or 8 for ADB-S  ... 
doi:10.1145/2502081.2502106 dblp:conf/mm/LiWCDWW13 fatcat:4yps4tjlhzbohhikrh4m7jvpbe

A New Noisy Random Forest Based Method for Feature Selection

Yassine Akhiat, Youness Manzali, Mohamed Chahhou, Ahmed Zinedine
2021 Cybernetics and Information Technologies  
Finally, the best subset of features is selected out of the best-ranked feature regarding the Geni impurity of this new variant of RF.  ...  Whereas, eliminating and preventing those noisy features first, the low ranked features may become more important.  ...  Based on the reliable feature importance of the proposed Noisy random forest, we rank features in a decreasingly reversed order.  ... 
doi:10.2478/cait-2021-0016 fatcat:4vtfk4p2kbebver4vzugsgez6u

A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars

Roderick Bloem, Joost Engelfriet
2000 Journal of computer and system sciences (Print)  
The mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in terms of the input tree.  ...  Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively.  ...  reversing the direction of all its edges, it turns into a term graph of which the unfolding is the output tree G(t).  ... 
doi:10.1006/jcss.1999.1684 fatcat:tnehitak4jgthgj5ll3firaa7i

Cellular Automata: Reversibility, Semi-reversibility and Randomness [article]

Kamalika Bhattacharjee
2019 arXiv   pre-print
To address reversibility of finite CAs, we develop a mathematical tool, named reachability tree, which can efficiently characterize those CAs.  ...  To do so, reversibility of CAs is redefined and the notion of semi-reversible CAs is introduced.  ...  There are many interesting results regarding reversibility of 1-dimensional CAs, over a given local map R, for the first three cases: Theorem 4.1 : The following statements hold for 1-dimensional infinite  ... 
arXiv:1911.03609v1 fatcat:522xu4usonfdbguuckurl4eeqi

Parallel solutions to geometric problems in the scan model of computation

Guy E. Blelloch, James J. Little
1994 Journal of computer and system sciences (Print)  
The segment abstraction permits a clean formulation of divideand-conquer algorithms and is used heavily in the algorithms described in this paper.  ...  The last convex-hull algorithm, merge-hull, utilizes a generalized binary search technique using divide-and-conquer with the segment abstraction.  ...  GENERALIZED BINARY SEARCH This section considers the problem of n elements of a set A each executing an implicit binary search on a balanced binary tree T with m vertices.  ... 
doi:10.1016/s0022-0000(05)80023-6 fatcat:2pa5dytifzawfbmnvpu3p5u4ji

Analysis of Feature Selection Algorithms on Classification: A Survey

S. Vanaja, K. Ramesh Kumar
2014 International Journal of Computer Applications  
The aim of this paper is to discuss about various feature selection algorithms applied on different datasets to select the relevant features to classify data into binary and multi class in order to improve  ...  When there is a multiclass dataset, the classification algorithm reduces the dataset into a binary class for simplification purpose by using any one of the data reduction methods and the algorithm is applied  ...  If the attribute A is a discrete value then binary tree must be produced.  ... 
doi:10.5120/16888-6910 fatcat:rdfgz4uehnbgrdo3cdmer7n2hy

Explicit lower bounds on strong quantum simulation [article]

Cupjin Huang, Michael Newman, Mario Szegedy
2018 arXiv   pre-print
We consider the problem of strong (amplitude-wise) simulation of n-qubit quantum circuits, and identify a subclass of simulators we call monotone.  ...  Finally, we compare strong simulators to existing SAT solvers, and identify the time-complexity below which a strong simulator would improve on state-of-the-art SAT solving.  ...  In particular, we thank Yaoyun for first posing the question of space-efficient simulation with time-complexity O(d · 2 n ), out of which these ideas grew.  ... 
arXiv:1804.10368v2 fatcat:5coshesm5bfb7ay56k6t77npei

A Survey of Genetic Programming and Its Applications

2019 KSII Transactions on Internet and Information Systems  
To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures.  ...  But one of the most significant uses of GAs is the automatic generation of programs.  ...  An example of tree-based GP designed for simulating the evolutionary processes in the biological world with two types of species.  ... 
doi:10.3837/tiis.2019.04.002 fatcat:wsoz6h5dbjhdphyytdqsbr42di
« Previous Showing results 1 — 15 out of 5,700 results