Filters








41,687 Hits in 3.6 sec

Manipulating Trees with Hidden Labels [chapter]

Luca Cardelli, Philippa Gardner, Giorgio Ghelli
2003 Lecture Notes in Computer Science  
We study these issues in the context of a simplified data model: simple labeled trees with hidden labels, and programs that manipulate such trees. The edges of such trees are labeled with names.  ...  Data manipulation is based on pattern matching, with types that track the use of hidden labels.  ...  Gabbay for illuminating discussions on transpositions, and to Luís Caires who indirectly influenced this paper through earlier work with the first author.  ... 
doi:10.1007/3-540-36576-1_14 fatcat:fnwvlvldc5fvlgeily2vdstlae

Manipulating Trees with Hidden Labels

Luca Cardelli, Philippa Gardner, Giorgio Ghelli
2007 Electronical Notes in Theoretical Computer Science  
We study these issues in the context of a simplified data model: simple labeled trees with hidden labels, and programs that manipulate such trees. The edges of such trees are labeled with names.  ...  Data manipulation is based on pattern matching, with types that track the use of hidden labels.  ...  Gabbay for illuminating discussions on transpositions, and to Luís Caires who indirectly influenced this paper through earlier work with the first author.  ... 
doi:10.1016/j.entcs.2007.02.007 fatcat:hwxttro3rrhk5ivoyda6qhhjbm

Building Ensembles of Neural Networks with Class-Switching [chapter]

Gonzalo Martínez-Muñoz, Aitor Sánchez-Martínez, Daniel Hernández-Lobato, Alberto Suárez
2006 Lecture Notes in Computer Science  
The perturbation consists in switching the class labels of a subset of training examples selected at random.  ...  In particular, networks with 28 hidden units, trained over 1000 epochs are used.  ...  The base classifiers are feedforward neural networks with one hidden layer. Sigmoidal transfer functions for both the hidden and output layers are used.  ... 
doi:10.1007/11840817_19 fatcat:rpxcmtuf5bfklj5fcpldqbhwiq

Enforcing Policies in Content Manipulation Signature Schemes

Martin Stanek
2006 International Journal of Network Security  
We propose a generalization of Merkle trees, so called Relaxed Merkle trees.  ...  Most of the constructions are based on Merkle trees.  ...  A Merkle Tree is a complete binary tree of height h with nodes labelled by binary strings. The label assigned to node v w is denoted by V(v w ).  ... 
dblp:journals/ijnsec/Stanek06 fatcat:zwzgvsqmsvdorisjr72gq4dpne

Visualizing large hierarchical clusters in hyperbolic space

J. Bingham, S. Sudarsanam
2000 Bioinformatics  
HyperTree is an application to visualize and navigate large trees in hyperbolic space.  ...  It includes colorcoding, search mechanisms and navigational aids, as well as focus+context viewing, allowing enormous trees to fit within the fixed space of a computer screen or printed page.  ...  Labels can be edited, rendered in any native font, and hidden if they prove too cluttered or distracting. Even when hidden, labels appear on mouse-over. Searching.  ... 
doi:10.1093/bioinformatics/16.7.660 pmid:11038340 fatcat:xtbdd3zvbbcrfkjpuso4m2e3ke

Understanding Contexts Inside Robot and Human Manipulation Tasks through a Vision-Language Model and Ontology System in a Video Stream [article]

Chen Jiang, Masood Dehghan, Martin Jagersand
2020 arXiv   pre-print
Our scheme works with real-world camera streams and fuses an attention-based Vision-Language model with the ontology system.  ...  Manipulation tasks in daily life, such as pouring water, unfold intentionally under specialized manipulation contexts.  ...  Ontology Tree Labeled Directed Graph: CentricMug Query Fig. 4 . From ontology system to object taxonomy.  ... 
arXiv:2003.01163v1 fatcat:liybqkazzvdo7itgy6b55qhvvu

Adaptive Threshold Displacement algorithm for removing hidden information from digital images

Fahimeh Rezaei, Michael Hempel, Tao Ma, Pradhumna Lal Shrestha, Dongming Peng, Hamid Sharif
2013 2013 IEEE Global Communications Conference (GLOBECOM)  
The presented results show that virtually all of the hidden information is destroyed by our proposed ATD algorithm, with a retrieval BER of over 40% in average.  ...  For evaluating the effectiveness of our proposed algorithm, we apply ATD to different images that contain hidden information, embedded using two different widely used steganography techniques.  ...  We employ these manipulations against the same image test set containing hidden information embedded utilizing wavelet tree quantization and histogram-based algorithms.  ... 
doi:10.1109/glocom.2013.6831143 dblp:conf/globecom/RezaeiHMSPS13 fatcat:ufp3y22gwfb73jyqxtmn6vokc4

Geometric modeling using octree encoding

Donald Meagher
1982 Computer Graphics and Image Processing  
hidden surfaces removed.  ...  Real time analysis and manipulation of highly complex situations thus becomes possible.  ...  Conveniently, this is the normal result of tree manipulation operations. Boolean operations are straightforward tree traversal algorithms.  ... 
doi:10.1016/0146-664x(82)90104-6 fatcat:afy6vckkjncf3bgkjjyabhoraq

Geometric modeling using octree encoding

Donald Meagher
1982 Computer Graphics and Image Processing  
hidden surfaces removed.  ...  Real time analysis and manipulation of highly complex situations thus becomes possible.  ...  Conveniently, this is the normal result of tree manipulation operations. Boolean operations are straightforward tree traversal algorithms.  ... 
doi:10.1016/0146-664x(82)90128-9 fatcat:6q2zs2zna5cqbalclbv6a7y2oy

Encoding Labeled Graphs by Labeling RAAM

Alessandro Sperduti
1993 Neural Information Processing Systems  
Direct access by content can be achieved by transforming the encoder network of the LRAAM into an analog Hopfield network with hidden units.  ...  This extension, the Labeling RAAM (LRAAM), can encode labeled graphs with cycles by representing pointers explicitly. Data encoded in an LRAAM can be accessed by pointer as well as by content.  ...  It can be considered as an extension of the RAAM model, which allows one to encode not only trees with information on the leaves, but also labeled graphs with cycles.  ... 
dblp:conf/nips/Sperduti93 fatcat:ojjg5p5x7jhnxgp53mecwke7fy

Analyzing Probability Vectors for Named Entity Statistical Machine Transliteration

M. L.Dhore, S. K. Dixit, T. D. Sonwalkar
2012 International Journal of Computer Applications  
Currently, basic Markov Chain Model (MM), Extended Markov Chain (EMC), Hidden Markov Model (HMM), Conditional Random Fields (CRF), Decision Tree (DT), Maximum Entropy Markov Model (MEMM) and Support Vector  ...  Decision tree should be used along with probability models where decisions are to be taken runtime with no recall under incomplete knowledge.  ...  In decision tree approach a tree like model of decisions is used along with their possible outcomes. These possible outcomes could be chance event outcomes, resource costs, and utility.  ... 
doi:10.5120/8791-2776 fatcat:y3bz45jmbzejrpocuymqqe6ium

Recognition of Manipulation Sequences by Human Hand Based on Support Vector Machine

Kazuya Matsuo, Kouji Murakami, Tsutomu Hasegawa, Ryo Kurazume
2007 IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society  
The binary decision tree constructed by our method has been evaluated through experiments of recognizing the task states during a valve manipulation.  ...  We define several task states which are segmented from the continuous motion of human fingers in the context of an object manipulation.  ...  The decision node of the tree is labeled by SV M (U 1 max, U 2 max). Two terminal nodes of the tree are labeled by U 1 max and U 2 max respectively. (5) U 1 max → U , U 2 max → U . go to (1).  ... 
doi:10.1109/iecon.2007.4460099 fatcat:o3oesha6s5eune3e6vo5jiisbi

Class-switching neural network ensembles

Gonzalo Martínez-Muñoz, Aitor Sánchez-Martínez, Daniel Hernández-Lobato, Alberto Suárez
2008 Neurocomputing  
This modification consists in switching the class labels of a fraction of training examples that are selected at random from the original training set.  ...  Abstract This article investigates the properties of class-switching ensembles composed of neural networks and compares them to class-switching ensembles of decision trees and to standard ensemble learning  ...  In particular, networks with a single layer of 28 hidden units, trained over 1000 epochs are used.  ... 
doi:10.1016/j.neucom.2007.11.041 fatcat:rqwp4mgz2banzj6cyjpruhm3we

A model patient

Jiajia Luo, James A. Ashton-Miller, John O.L. DeLancey
2011 American Journal of Obstetrics and Gynecology  
To produce this tool, 3D volumetric models were created from serial 5-mm-thick images that were obtained with a 3-Tesla magnetic resonance scanner.  ...  Each structure was traced with the use of the most clearly visible axial and/or coronal plane images and lofted into a 3D virtual model that was based on our previous anatomic work. [1] [2] [3] [4] [5]  ...  FIGURE 2 . 2 The manipulation interface includes a model tree and toolbar.  ... 
doi:10.1016/j.ajog.2011.08.018 pmid:22083062 pmcid:PMC3616191 fatcat:visrfbdbm5cubgb53lisqm5fiq

Roget2000: a 2D hyperbolic tree visualization of Roget's Thesaurus

Jason Baumgartner, Tim A. Waugh, Robert F. Erbacher, Philip C. Chen, Matti Groehn, Jonathan C. Roberts, Craig M. Wittenbrink
2002 Visualization and Data Analysis 2002  
The direct manipulation functions allow the user to customize the appearance of the tree, to view the density of terms associated with particular concepts, and to view the thesaurus entries associated  ...  with each term.  ...  ACKNOWLEDGEMENTS We thank John Old for supplying us with the inspiration for this project and the corresponding data.  ... 
doi:10.1117/12.458803 dblp:conf/vda/BaumgartnerW02 fatcat:43sgh6usavbrllsck2y7dmf7oi
« Previous Showing results 1 — 15 out of 41,687 results