Search results for "st-alphabets"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
131	Carlos D. Toledo-Suárez	A first assessment of the use of extended relational alphabets in accuracy classifier systems.	GECCO	2010	DBLP DOI BibTeX RDF	parity problem, relational alphabets, relational schemata, st-alphabets, classifier systems
91	Jacek Lenckowski, Krzysztof Walczak 0002	Simplifying Amino Acid Alphabets Using a Genetic Algorithm and Sequence Alignment.	EvoBIO	2007	DBLP DOI BibTeX RDF	amino acid alphabet, substitution matrices, sequence alignment, protein classification
78	Martin Farach	Optimal Suffix Tree Construction with Large Alphabets.	FOCS	1997	DBLP DOI BibTeX RDF	large alphabets, combinatorial pattern matching, integer alphabet, integer alphabets, data structure, pattern matching, sorting, suffix tree
75	Carlos D. Toledo-Suárez	st-Alphabets: On the Feasibility in the Explicit Use of Extended Relational Alphabets in Classifier Systems.	MICAI	2009	DBLP DOI BibTeX RDF
69	Renwei Ge, Gonzalo R. Arce, Giovanni Di Crescenzo	Approximate Message Authentication Codes for N-ary Alphabets.	IEEE Trans. Inf. Forensics Secur.	2006	DBLP DOI BibTeX RDF
63	Frank Neven, Thomas Schwentick, Victor Vianu	Finite state machines for strings over infinite alphabets.	ACM Trans. Comput. Log.	2004	DBLP DOI BibTeX RDF	infinite alphabets, XML, Automata, first-order logic, expressiveness, pebbles, monadic second-order logic, registers
53	Jung-Wook Cho, Soo-Young Lee, Cheol Hoon Park	On-line Handwritten Character Recognition by a Hybrid Method based on Neural Networks and Pattern Matching.	IWANN	1995	DBLP DOI BibTeX RDF
52	Miki Namatame, Yasushi Harada, Fusako Kusunoki, Shigenori Inagaki, Takao Terano	To use PYA tool or not for learning Japanese hand alphabets.	Advances in Computer Entertainment Technology	2006	DBLP DOI BibTeX RDF	classroom experiments, learning hand alphabets, interaction design, personal computers, visual interface
48	Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat	Coding on Countably Infinite Alphabets.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
48	Martin Lillholm, Lewis D. Griffin	Novel image feature alphabets for object recognition.	ICPR	2008	DBLP DOI BibTeX RDF
48	Shude Zhou, Zengqi Sun, Robert B. Heckendorn	Extended probe method for linkage discovery over high-cardinality alphabets.	GECCO	2007	DBLP DOI BibTeX RDF	high-cardinality probe, linkage detection, Fourier transform, epistasis
48	Mihaela Gheorghiu, Dimitra Giannakopoulou, Corina S. Pasareanu	Refining Interface Alphabets for Compositional Verification.	TACAS	2007	DBLP DOI BibTeX RDF
47	Crina Grosan, Mihai Oltean	Adaptive representation for single objective optimization.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Single objective optimization, Higher alphabets encoding, Evolution strategy, Adaptive representation
47	Byung Hwan Jun, Moo Young Kim, Chang Soo Kim, Woo Seong Kim, Jaihie Kim	On-line cursive Korean character recognition by using curvature models.	ICDAR	1995	DBLP DOI BibTeX RDF	online cursive Korean character recognition, curvature models, Korean alphabets, candidate references, structural curvature models, character recognition, image matching, line segments, primitives
43	Guo Xian Tan, Christian Viard-Gaudin, Alex C. Kot	Impact of Alphabet Knowledge on Online Writer Identification.	ICDAR	2009	DBLP DOI BibTeX RDF
43	Georg Schnitger	Regular Expressions and NFAs Without epsilon-Transitions.	STACS	2006	DBLP DOI BibTeX RDF
37	Stefan Pletschacher	A Self-Adaptive Method for Extraction of Document-Specific Alphabets.	ICDAR	2009	DBLP DOI BibTeX RDF
37	Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin Wu 0001	Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets.	IEEE Trans. Commun.	2007	DBLP DOI BibTeX RDF
37	Miki Namatame, Fusako Kusunoki, Shigenori Inagaki, Takao Terano	Practice! YUBIMOJI AIUEO: An Edutainment System of Japanese Hand Alphabets for Elementary School Children.	Asia International Conference on Modelling and Simulation	2007	DBLP DOI BibTeX RDF
37	Charalambos Ioannides, Will N. Browne	Investigating Scaling of an Abstracted LCS Utilising Ternary and S-Expression Alphabets.	IWLCS	2007	DBLP DOI BibTeX RDF
37	Gil I. Shamir	Universal Lossless Compression With Unknown Alphabets - The Average Case.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
37	Gil I. Shamir	On the MDL principle for i.i.d. sources with large alphabets.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
37	Jürgen Dassow, György Vaszil	P Finite Automata and Regular Languages over Countably Infinite Alphabets.	Workshop on Membrane Computing	2006	DBLP DOI BibTeX RDF
37	Dong Kyue Kim, Junha Jo, Heejin Park	A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets.	WEA	2004	DBLP DOI BibTeX RDF
37	Michael Kaminski, Tony Tan	Regular Expressions for Languages over Infinite Alphabets.	COCOON	2004	DBLP DOI BibTeX RDF
37	Frank Neven, Thomas Schwentick, Victor Vianu	Towards Regular Languages over Infinite Alphabets.	MFCS	2001	DBLP DOI BibTeX RDF
37	Edward Y. C. Cheng, Michael Kaminski	Context-Free Languages over Infinite Alphabets.	Acta Informatica	1998	DBLP DOI BibTeX RDF
37	Christopher J. Shaw	On declaring arbitrarily coded alphabets.	Commun. ACM	1964	DBLP DOI BibTeX RDF
32	Xiao Xu	Generalisation of Alternating Automata over Infinite Alphabets. (Généralisation d'Automates Alternatifs sur des Alphabets Infinis).		2020	RDF
32	Irini-Eleftheria Mens	Learning regular languages over large alphabets. (Apprentissage de langages réguliers sur des alphabets de grandes tailles).		2017	RDF
32	Aurélien Leroux	Inférence grammaticale sur des alphabets ordonnés : application à la découverte de motifs dans des familles de protéines. (Grammatical inference on ordered alphabets : application to pattern discovery in proteins).		2005	RDF
32	Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota 0001, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov	On Subset Seeds for Protein Alignment.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	subset seeds, seed alphabet, similarity search, selectivity, sensitivity, seeds, local alignment, Protein sequences, protein databases, multiple seeds
32	Serap A. Savari	On One-to-One Codes for Memoryless Cost Channels.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
32	Rodrigo de Miguel, Ralf R. Müller	Real vs. complex BPSK precoding for MIMO broadcast channels.	PIMRC	2008	DBLP DOI BibTeX RDF
32	Miroslaw Truszczynski, Stefan Woltran	Relativized Hyperequivalence of Logic Programs for Modular Programming.	ICLP	2008	DBLP DOI BibTeX RDF
32	George M. Gemelos, Tsachy Weissman	On the Entropy Rate of Pattern Processes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
32	Stephanie Perkins, Alexander L. Sakhnovich, Derek H. Smith	On an upper bound for mixed error-correcting codes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
32	Rza Nuriyev, Achilleas Anastasopoulos	Capacity and coding for the block-independent noncoherent AWGN channel.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
32	Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang 0001	Fast prefix matching of bounded strings.	ACM J. Exp. Algorithmics	2003	DBLP DOI BibTeX RDF	prefix matching, tries, table look-up, IP routing
32	Dónall A. Mac Dónaill	Molecularly Accessible Permutations.	ECAL	2003	DBLP DOI BibTeX RDF
32	Alberto Apostolico, Dany Breslauer, Zvi Galil	Parallel Detection of all Palindromes in a String.	STACS	1994	DBLP DOI BibTeX RDF
27	Wiebke Petersen	On the Construction of Sivasutras-Alphabets.	Sanskrit Computational Linguistics	2009	DBLP DOI BibTeX RDF	?ivas?tras, lattices, orders, P??ini
27	Tony Tan	Graph Reachability and Pebble Automata over Infinite Alphabets.	LICS	2009	DBLP DOI BibTeX RDF
27	Miguel A. Jiménez-Montaño, Matthew He	Irreplaceable Amino Acids and Reduced Alphabets in Short-Term and Directed Protein Evolution.	ISBRA	2009	DBLP DOI BibTeX RDF	Codon volatility, amino acid changeability, genetic mutations, reduced alphabet
27	Amaldev Manuel, Ramaswamy Ramanujam	Counting Multiplicity over Infinite Alphabets.	RP	2009	DBLP DOI BibTeX RDF
27	Tiago Lopes Telecken, Ethan V. Munson, José Valdeni de Lima	Applying markup language resources in the specification of visual alphabets and visual sentences.	SAC	2008	DBLP DOI BibTeX RDF	visual alphabet, visual sentence, XML
27	Ge Nong, Sen Zhang	Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets.	WADS	2007	DBLP DOI BibTeX RDF
27	Tristan Le Gall, Bertrand Jeannet	Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification.	SAS	2007	DBLP DOI BibTeX RDF
27	Venkatesan Guruswami, Anindya C. Patthak	Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets.	FOCS	2006	DBLP DOI BibTeX RDF
27	Abdullah N. Arslan	Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.	LATIN	2006	DBLP DOI BibTeX RDF	d-query, approximate dictionary look-up, space efficient algorithm, suffix tree, edit distance, preprocessing, Hamming distance
27	Da-ke He, En-Hui Yang	The universality of grammar-based codes for sources with countably infinite alphabets.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
27	Shiri Dori, Gad M. Landau	Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.	CPM	2005	DBLP DOI BibTeX RDF
27	Joong Chae Na	Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.	CPM	2005	DBLP DOI BibTeX RDF
27	Maria Teresa Iglesias, Bart Naudts, Alain Verschoren, Concepción Vidal	Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets.	GECCO	2005	DBLP DOI BibTeX RDF	multary alphabet, partition coefficient, schema average, walsh coefficient, genetic algorithm, walsh function, schema theory
27	Miki Namatame, Yasushi Harada, Fusako Kusunoki, Takao Terano, Shigenori Inagaki	What you look like when learning hand alphabets.	Advances in Computer Entertainment Technology	2005	DBLP DOI BibTeX RDF	PC camera, eye tracking device, learning hand characters, visual interface
27	Audrey Seropian, Michel Grimaldi, Nicole Vincent	Differentiation of Alphabets in Handwritten Texts.	ICPR (2)	2004	DBLP DOI BibTeX RDF	differentiation of alphabet, extraction of invariant patterns, pattern matching, fractal compression
27	Cezar Câmpeanu, Andrei Paun	Tight Bounds for NFA to DFCA Transformations for Binary Alphabets.	CIAA	2004	DBLP DOI BibTeX RDF
27	Daniel Reidenbach	On the Equivalence Problem for E-pattern Languages over Small Alphabets.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
27	Yasushi Harada, Fusako Kusunoki, Miki Namatame, Takao Terano	Visual, attractive, and luminous: learning Japanese hand alphabets for elementary school pupils.	CHI Extended Abstracts	2004	DBLP DOI BibTeX RDF	learning hand language, visual interface
27	Thomas Stibor, Kpatcha M. Bayarou, Claudia Eckert 0001	An Investigation of R-Chunk Detector Generation on Higher Alphabets.	GECCO (1)	2004	DBLP DOI BibTeX RDF
27	Daniel Reidenbach	On the Learnability of E-pattern Languages over Small Alphabets.	COLT	2004	DBLP DOI BibTeX RDF
27	Dong Kyue Kim, Jeong Eun Jeon, Heejin Park	An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.	SPIRE	2004	DBLP DOI BibTeX RDF
27	Alon Orlitsky, Narayana P. Santhanam	Performance of universal codes over infinite alphabets.	DCC	2003	DBLP DOI BibTeX RDF
27	Venkatesan Guruswami, Piotr Indyk	Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets.	STOC	2002	DBLP DOI BibTeX RDF
27	Kimmo Fredriksson	Faster String Matching with Super-Alphabets.	SPIRE	2002	DBLP DOI BibTeX RDF
27	Luc Boasson	Some Applications of CFL's over Infinte Alphabets.	Theoretical Computer Science	1981	DBLP DOI BibTeX RDF
26	Michael Kaminski, Nissim Francez	Finite-Memory Automata (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	Rabin-Scott finite-state automata, finite-memory automata, infinite alphabets, equality test, unification
21	Antonio Restivo, Giovanna Rosone	Balanced Words Having Simple Burrows-Wheeler Transform.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
21	Bryant A. Julstrom	A data-based coding of candidate strings in the closest string problem.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	closest string problem, data-based coding, genetic algorithm
21	Korakot Prachumrak	Weighted Finite Automata encoding over Thai language.	ICIS	2009	DBLP DOI BibTeX RDF	Thai language, weighted finite automata, data compression, text
21	Corina S. Pasareanu, Dimitra Giannakopoulou, Mihaela Gheorghiu Bobaru, Jamieson M. Cobleigh, Howard Barringer	Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning.	Formal Methods Syst. Des.	2008	DBLP DOI BibTeX RDF	Model checking, Learning, Labeled transition systems, Compositional verification, Safety properties, Assume-guarantee reasoning, Proof rules
21	Boris Skoric, Stefan Katzenbeisser 0001, Mehmet Utku Celik	Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	AMS Classification 94B60
21	Ralf R. Müller, Dongning Guo, Aris L. Moustakas	Vector Precoding for Wireless MIMO Systems and its Replica Analysis.	IEEE J. Sel. Areas Commun.	2008	DBLP DOI BibTeX RDF
21	Jia-Li You 0001, Yining Chen, Min Chu, Frank K. Soong, Jin-Lin Wang 0001	Identifying Language Origin of Named Entity With Multiple Information Sources.	IEEE Trans. Speech Audio Process.	2008	DBLP DOI BibTeX RDF
21	Mihaela Gheorghiu Bobaru, Corina S. Pasareanu, Dimitra Giannakopoulou	Automated Assume-Guarantee Reasoning by Abstraction Refinement.	CAV	2008	DBLP DOI BibTeX RDF
21	Minseo Park, B. G. Kim	Complementary grouping of amino acids based on base-pairing.	BIBE	2008	DBLP DOI BibTeX RDF
21	Dominik D. Freydenberger, Daniel Reidenbach	Bad News on Decision Problems for Patterns.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
21	Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota 0001, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov	Efficient Seeding Techniques for Protein Similarity Search.	BIRD	2008	DBLP DOI BibTeX RDF
21	Francisco Claude, Gonzalo Navarro 0001	Practical Rank/Select Queries over Arbitrary Sequences.	SPIRE	2008	DBLP DOI BibTeX RDF
21	Patrick Mitran, Natasha Devroye, Vahid Tarokh	On compound channels with side information at the transmitter.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
21	David Liben-Nowell, Erik Vee, An Zhu	Finding longest increasing and common subsequences in streaming data.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Data-streaming model, Algorithms, Lower bounds, LCS, LIS
21	Afshin Sepehri, Yaser Yacoob, Larry S. Davis	Parametric Hand Tracking for Recognition of Virtual Drawings.	ICVS	2006	DBLP DOI BibTeX RDF
21	Zhi-Wei Chen, Yu-Cheng Lin, Cheng-Chin Chiang	In this paper, an approach for deaf-people.	ICPR (2)	2006	DBLP DOI BibTeX RDF
21	Jan Arpe, Rüdiger Reischuk	On the Complexity of Optimal Grammar-Based Compression.	DCC	2006	DBLP DOI BibTeX RDF
21	Changhui Yan, Jing Hu 0001	A Hidden Markov Model Approach to Identifying HTH Motifs Using Protein Sequence and Predicted Solvent Accessibility.	CIBCB	2006	DBLP DOI BibTeX RDF
21	Chuanhan Liu, Yongcheng Wang, Derong Liu, Danglin Li	Two Improved Single Pattern Matching Algorithms.	ICAT Workshops	2006	DBLP DOI BibTeX RDF
21	J. Shane Culpepper, Alistair Moffat	Phrase-Based Pattern Matching in Compressed Text.	SPIRE	2006	DBLP DOI BibTeX RDF
21	Silvio Micali, Chris Peikert, Madhu Sudan 0001, David A. Wilson	Optimal Error Correction Against Computationally Bounded Noise.	TCC	2005	DBLP DOI BibTeX RDF
21	Jesper Jansson 0001, Zeshan Peng	Online and Dynamic Recognition of Squarefree Strings.	MFCS	2005	DBLP DOI BibTeX RDF
21	George M. Gemelos, Tsachy Weissman	On the Entropy Rate of Pattern Processes.	DCC	2005	DBLP DOI BibTeX RDF
21	Olga L. Bandman	Composing Fine-Grained Parallel Algorithms for Spatial Dynamics Simulation.	PaCT	2005	DBLP DOI BibTeX RDF
21	Jaewoo Ahn, Myung Ho Kim	General-Purpose Text Entry Rules for Devices with 4x3 Configurations of Buttons.	ICCSA (1)	2005	DBLP DOI BibTeX RDF
21	Amnon Ta-Shma, David Zuckerman	Extractor codes.	IEEE Trans. Inf. Theory	2004	DBLP DOI BibTeX RDF
21	Gil I. Shamir	Sequential Universal Lossless Techniques for Compression of Patterns and Their Description Length.	Data Compression Conference	2004	DBLP DOI BibTeX RDF
21	Isaac Elias	Settling the Intractability of Multiple Alignment.	ISAAC	2003	DBLP DOI BibTeX RDF
21	François Nicolas, Eric Rivals	Complexities of the Centre and Median String Problems.	CPM	2003	DBLP DOI BibTeX RDF
21	Serap A. Savari	On Compressing Interchange Classes of Events in a Concurrent System.	DCC	2003	DBLP DOI BibTeX RDF
21	Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin Wu 0001	Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions.	DCC	2003	DBLP DOI BibTeX RDF
21	Amihood Amir, Kenneth Ward Church, Emanuel Dar	Separable attributes: a technique for solving the sub matrices character count problem.	SODA	2002	DBLP BibTeX RDF
21	Vladimir Filkov, Steven Skiena, Jizu Zhi	Analysis techniques for microarray time-series data.	RECOMB	2001	DBLP DOI BibTeX RDF