Filters








29,669 Hits in 3.3 sec

Deletion operations: closure properties

Lila Kari
1994 International Journal of Computer Mathematics  
Some results are the expected ones: the sequential (iterated sequential, dipolar) deletion from a regular language produces a regular set regardless of the complexity of the deleted language.  ...  On the other hand, it still remains a challenging open problem whether or not the family of regular languages is closed under iterated parallel deletion with singletons.  ...  one, the scattered deletion L > R is the image of L through a gsm mapping.  ... 
doi:10.1080/00207169408804288 fatcat:ncyeu7geergzngenki5fk7eycm

Representing recursively enumerable languages by iterated deletion

Michael Domaratzki, Alexander Okhotin
2004 Theoretical Computer Science  
This solves two open problems posed by Ito and Silva on the closure properties and decidability of iterated deletion.  ...  A characterization of the recursively enumerable languages in terms of the iterated deletion operation is given.  ...  Introduction and deÿnitions Iterated deletion operations, including iterated sequential and scattered deletion, have received much attention recently, see [5] [6] [7] 9] .  ... 
doi:10.1016/j.tcs.2004.01.002 fatcat:jrf3wox24vb5lhmahnow2kqg6m

On language equations with invertible operations

Lila Kari
1994 Theoretical Computer Science  
L, On language equations with invertible operations, Theoretical Computer Science 132 (1994) 129-l 50.  ...  In case L is a context-free language and R is a regular one, the existence of a solution is generally undecidable.  ...  scattered insertion, iterated deletion, permuted deletion, permuted scattered deletion.  ... 
doi:10.1016/0304-3975(94)90230-5 fatcat:43g2a7tqzbhm3pih66bj4lc3lm

Evaluation of Feature Selection by Multiclass Kernel Discriminant Analysis [chapter]

Tsuneyoshi Ishii, Shigeo Abe
2010 Lecture Notes in Computer Science  
To speed up backward feature selection, we introduce block deletion, which deletes many features at a timeC and to enhance generalization ability of the selected features we use cross-validation as a stopping  ...  In this paper, we propose and evaluate the feature selection criterion based on kernel discriminant analysis (KDA) for multiclass problems, which finds the number of classes minus one eigenvectors.  ...  We iterate feature deletion so long as the value of the selection criterion is larger than the prescribed threshold.  ... 
doi:10.1007/978-3-642-12159-3_2 fatcat:wyxolyyt2jhutieenkbtukke4a

AdaptiveB-spline scheme for solving an inverse scattering problem

Alexandre Baussard, Eric L Miller, Denis Prémel
2004 Inverse Problems  
A specific knot insertion process, based on curvature information, and a specific knot deletion method, based on data fitting, are proposed.  ...  An iterative scheme is proposed in which, at each stage, we seek to improve our estimate of the object through the insertion and deletion of knots.  ...  In this work, a knot insertion procedure based on curvature information and a deletion procedure based on data fitting are proposed.  ... 
doi:10.1088/0266-5611/20/2/003 fatcat:sdiwibxchjbqldnfbtvploj5fm

TIGAR: transcript isoform abundance estimation method with gapped alignment of RNA-Seq data by variational Bayesian inference

Naoki Nariai, Osamu Hirose, Kaname Kojima, Masao Nagasaki
2013 Computer applications in the biosciences : CABIOS  
Our method can handle gapped alignments of reads against reference sequences so that it allows insertion or deletion errors within reads.  ...  The proposed method optimizes the number of transcript isoforms by variational Bayesian inference through an iterative procedure, and its convergence is guaranteed under a stopping criterion.  ...  ., 2008) , which roughly corresponds to one iteration of the EM algorithm.  ... 
doi:10.1093/bioinformatics/btt381 pmid:23821651 fatcat:ghudes5vlfft5bt4czpy6wf2aq

Interprocedural compilation of irregular applications for distributed memory machines

Gagan Agrawal, Joel Saltz
1995 Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '95  
We also present three new interprocedural optimizations: placement of scatter routines, deletion of data structures and use of coalescing and incremental routines.  ...  In the procedure Proc A, the scatter operation can be deleted, since this scatter is subsumed by the scatter done later in Proc B.  ...  Figure 12 : 12 E ect of Optimizations on Charmm template 20 iterations on Intel Paragon. latencies.  ... 
doi:10.1145/224170.224336 dblp:conf/sc/AgrawalS95 fatcat:2lgfnreadrb5zjveqsnadkbbgu

Feature selection based on kernel discriminant analysis for multi-class problems

Tsuneyoshi Ishii, Shigeo Abe
2008 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)  
The criterion results in calculating the sum of eigenvalues associated with the eigenvectors and is shown to be monotonic for the deletion or addition of features.  ...  We propose a feature selection criterion based on kernel discriminant analysis (KDA) for an -class problem, which finds eigenvectors on which the projected class data are locally maximally separated.  ...  samples in the feature space are projected onto vector , the total scatter matrix and the between scatter matrix on are given, respectively, by KDA seeks vector that maximizes the ratio of total scatter  ... 
doi:10.1109/ijcnn.2008.4634140 dblp:conf/ijcnn/IshiiA08 fatcat:odh3jtr3frfjzen7youaraksx4

Scatterer and virtual source detection for indoor UWB channels

M. Froehle, P. Meissner, T. Gigl, K. Witrisal
2011 2011 IEEE International Conference on Ultra-Wideband (ICUWB)  
Results show that estimated locations of virtual sources and scatterers fit very well with the expected locations.  ...  We present an extension of an existing outdoor UWB scatterer detection algorithm [1], [2], making it usable for indoor scenarios.  ...  The LOS scatterer is the first one to be selected and removed from the channel by the algorithm. The lower plot contains the CIRs after 16 iterations.  ... 
doi:10.1109/icuwb.2011.6058819 fatcat:57zcczjm4nbblflglwciwmdt4q

Computer supported workflow for cataloging and management in digital libraries

Weimao Ke, Javed Mostafa, Gayathri S. Athreya
2009 Proceedings of the American Society for Information Science and Technology  
It helps users refine search criteria through iterations of cluster selection and reclustering.  ...  Scatter/Gather Browser As an interaction mode, Scatter/Gather is well known for its ease of use and effectiveness in situations where it is difficult to precisely specify a query (Cutting, Karger, Pedersen  ... 
doi:10.1002/meet.2008.1450450304 fatcat:zptdgesatvbf5l65z7v3sdztii

Evolutionary Approaches to DNA Sequencing with Errors

Jacek Blazewicz, Fred Glover, Marta Kasprzak
2005 Annals of Operations Research  
The older of them is based on the idea of genetic approach and is enhanced by a greedy algorithm. The newly proposed algorithm combines the tabu search and the scatter search methods.  ...  After conducting experiments with random and coding DNA sequences, our results suggest that the tabu and scatter search algorithm finds solutions of higher quality and more reliably than the genetic algorithm  ...  In such a case, an element that has been on the tabu list for the greatest number of iterations is chosen.  ... 
doi:10.1007/s10479-005-2445-2 fatcat:77ewbz5q4valvbxiwhqdsf4iny

GraphIn: An Online High Performance Incremental Graph Processing Framework [chapter]

Dipanjan Sengupta, Narayanan Sundaram, Xia Zhu, Theodore L. Willke, Jeffrey Young, Matthew Wolf, Karsten Schwan
2016 Lecture Notes in Computer Science  
As part of GraphIn, we propose a novel programming model called I-GAS (based on gather-apply-scatter programming paradigm) that allows for implementing a large set of incremental graph processing algorithms  ...  Most prior work processes dynamic graphs by first storing the updates and then repeatedly running static graph analytics on saved snapshots.  ...  But deletes must be applied before the next update batch is considered. Finally, there are algorithms where each incremental iteration has no dependency on inserts or deletes from the previous batch.  ... 
doi:10.1007/978-3-319-43659-3_24 fatcat:ip3ynlf4ozb33o4khogvcz6i3e

A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides

Roland W. Freund, Manish Malhotra
1997 Linear Algebra and its Applications  
Instead of applying an iterative method to each of these systems individually, it is often more efficient to employ a block version of the method that generates iterates for all the systems simultaneously  ...  In this paper, we propose a block version of Freund and Nachtigal's quasi-minimal residual (QMR) method for the iterative solution of non-Hermitian linear systems.  ...  I (4.18) Consequently, it is possible to delete one of the linear systems from subsequent BL-QMR iterations.  ... 
doi:10.1016/s0024-3795(96)00529-0 fatcat:jqe2tdscw5hqfomvholdriioua

Power of controlled insertion and deletion [chapter]

Lila Kari
1994 Lecture Notes in Computer Science  
Each of the classes studied is closed under an insertion operation, a deletion operation and an iterative insertion one.  ...  The iterative operation has been included in each class to provide an infinite growth of the strings.  ...  , controlled deletion, scattered deletion.  ... 
doi:10.1007/3-540-58131-6_48 fatcat:gizp2xu4nneuxawczv2rjorszm

CT artifacts: causes and reduction techniques

F Edward Boas, Dominik Fleischmann
2012 Imaging in Medicine  
The Metal Deletion Technique (MDT) is an iterative technique that reduces artifacts due to all of these mechanisms. In some cases, the improved image quality can change the diagnosis.  ...  These can be reduced using iterative reconstruction. Dual energy CT reduces beam hardening, but not scatter. • Beam hardening and scatter also cause pseudoenhancement of renal cysts.  ...  Acknowledgements We thank Scott Hsieh, Dan Sze, and Lewis Shin for helpful comments on the manuscript. Mark Riccio from Cornell Imaging provided the micro CT image.  ... 
doi:10.2217/iim.12.13 fatcat:3iuft7cbhjh5vjuhcgojvyvgue
« Previous Showing results 1 — 15 out of 29,669 results