Search results for "bit-parallelism"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
62	Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro 0001	Increased bit-parallelism for approximate and multiple string matching.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	multiple string matching, Approximate string matching, bit-parallelism
40	Kimmo Fredriksson, Szymon Grabowski	Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching.	WEA	2006	DBLP DOI BibTeX RDF	protein matching, music information retrieval, approximate string matching, bit-parallelism, nondeterministic finite automata
37	Jan Holub 0001	Bit Parallelism - NFA Simulation.	CIAA	2001	DBLP DOI BibTeX RDF
33	Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro 0001	Increased Bit-Parallelism for Approximate String Matching.	WEA	2004	DBLP DOI BibTeX RDF
30	Xue-Guang Wang	Multi-Dimensional Packet Classification Using Tuple Space Based on Bit-Parallelism.	IIH-MSP	2006	DBLP DOI BibTeX RDF
27	Domenico Cantone, Simone Faro, Emanuele Giaquinta	Bit-(Parallelism)2: Getting to the Next Level of Parallelism.	FUN	2010	DBLP DOI BibTeX RDF
26	Bala Kalyanasundaram, Kirk Pruhs	Fault-Tolerant Real-Time Scheduling.	Algorithmica	2000	DBLP DOI BibTeX RDF	String matching allowing errors, Approximate matching probability, Edit distance, Bit-parallelism
26	Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	Bit-Parallel Approach to Approximate String Matching in Compressed Texts.	SPIRE	2000	DBLP DOI BibTeX RDF	compressed texts, collage system, dictionary-based compression methods, machine word, pattern length, allowed errors, dictionary size, token sequence, Ziv-Lempel compression methods, compressed length, data compression, time complexity, space complexity, approximate string matching, bit-parallelism
19	Rajesh Prasad, Suneeta Agarwal, Ishadutta Yadav, Bharat Singh	Efficient bit-parallel multi-patterns string matching algorithms for limited expression.	Bangalore Compute Conf.	2010	DBLP DOI BibTeX RDF	BNDM, multiple patterns, shift-or, algorithm, bit-parallelism
19	Gonzalo Navarro 0001, Mathieu Raffinot	New Techniques for Regular Expression Searching.	Algorithmica	2005	DBLP DOI BibTeX RDF	Glushkov automaton, Compact DFA representation, BDM, Reverse factors, Bit-parallelism
19	Heikki Hyyrö, Gonzalo Navarro 0001	Bit-Parallel Witnesses and Their Applications to Approximate String Matching.	Algorithmica	2005	DBLP DOI BibTeX RDF	Backward DAWG matching, Myers bit-parallel algorithm, Average-optimal string matching allowing errors, Bit-parallelism
19	Gonzalo Navarro 0001, Mathieu Raffinot	Fast and simple character classes and bounded gaps pattern matching, with application to protein searching.	RECOMB	2001	DBLP DOI BibTeX RDF	PROSITE, information retrieval, pattern matching, computational biology, bit-parallelism
19	Ricardo A. Baeza-Yates, Gonzalo Navarro 0001	Faster Approximate String Matching.	Algorithmica	1999	DBLP DOI BibTeX RDF	Text searching allowing errors, Bit-parallelism
19	Gene Myers	A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming.	J. ACM	1999	DBLP DOI BibTeX RDF	approximate string search, sequence comparison, bit-parallelism
19	Randal C. Burns, Wayne Hineman	A Bit-Parallel Search Algorithm for Allocating Free Space.	MASCOTS	2001	DBLP DOI BibTeX RDF
18	M. Oguzhan Külekci	A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching.	ISAAC	2008	DBLP DOI BibTeX RDF
17	Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen	From Bit-Parallelism to Quantum String Matching for Labelled Graphs.	CPM	2023	DBLP DOI BibTeX RDF
17		From Bit-Parallelism to Quantum: Breaking the Quadratic Barrier.	CoRR	2021	DBLP BibTeX RDF
17	Mohammad Hasan Samadani, Mehdi Berenjkoub, Marina Blanton	Secure pattern matching based on bit parallelism - Non-interactive protocols for non-deterministic string matching automata evaluation.	Int. J. Inf. Sec.	2019	DBLP DOI BibTeX RDF
17	Pablo San Segundo, Jorge Artieda, Darren Strash	Efficiently enumerating all maximal cliques with bit-parallelism.	Comput. Oper. Res.	2018	DBLP DOI BibTeX RDF
17	Pablo San Segundo, Jorge Artieda, Darren Strash	Efficiently Enumerating all Maximal Cliques with Bit-Parallelism.	CoRR	2018	DBLP BibTeX RDF
17	Abdulrakeeb M. Al-Ssulami, Hassan Mathkour	Faster string matching based on hashing and bit-parallelism.	Inf. Process. Lett.	2017	DBLP DOI BibTeX RDF
17	Chen Hou, Nan Li, Meng Zhang 0006	Efficient string matching on graphics processing unit using bit-parallelism.	Int. J. Wirel. Mob. Comput.	2016	DBLP DOI BibTeX RDF
17	Hirohito Sasakawa, Hiroki Arimura	Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data.	IIAI-AAI	2012	DBLP DOI BibTeX RDF
17	Rajesh Prasad, Suneeta Agarwal	A new parameterized string matching algorithm by combining bit-parallelism and suffix automata.	CIT	2008	DBLP DOI BibTeX RDF
17	Jan Supol, Borivoj Melichar	A New Approach to Determinisation Using Bit-Parallelism.	ICTAC	2006	DBLP DOI BibTeX RDF
17	Gonzalo Navarro 0001, Mathieu Raffinot	Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata.	ACM J. Exp. Algorithmics	2000	DBLP DOI BibTeX RDF
17	Sudhakar Menon, Peng Gao, Terence R. Smith	Multi-colored quadtrees for GIS: Exploiting bit-parallelism for rapid boolean overlay.	Pattern Recognit. Lett.	1988	DBLP DOI BibTeX RDF
14	Luís M. S. Russo, Arlindo L. Oliveira	An Efficient Algorithm for Generating Super Condensed Neighborhoods.	CPM	2005	DBLP DOI BibTeX RDF
14	Kjell Lemström, Gonzalo Navarro 0001	Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval.	SPIRE	2003	DBLP DOI BibTeX RDF
14	Michael Bolotski, Rod Barman, James J. Little, Daniel Camporese	Silt: A distributed bit-parallel architecture for early vision.	Int. J. Comput. Vis.	1993	DBLP DOI BibTeX RDF
11	Heraldo Maciel França Madeira, Hélio Pedrini	Boolean Decomposition of Binary Image Operators.	SIBGRAPI	2002	DBLP DOI BibTeX RDF	Boolean decomposition, binary image operator, image processor architecture, decision diagram
10	Luís M. S. Russo, Arlindo L. Oliveira	Faster Generation of Super Condensed Neighbourhoods Using Finite Automata.	SPIRE	2005	DBLP DOI BibTeX RDF
7	Matteo Campanelli, Domenico Cantone, Simone Faro	A New Algorithm for Efficient Pattern Matching with Swaps.	IWOCA	2009	DBLP DOI BibTeX RDF	empattern matching with swaps, nonstandard pattern matching, design and analysis of algorithms, combinatorial algorithms on words
7	Domenico Cantone, Simone Faro	Pattern Matching with Swaps for Short Patterns in Linear Time.	SOFSEM	2009	DBLP DOI BibTeX RDF	pattern matching with swaps, nonstandard pattern matching, design and analysis of algorithms, combinatorial algorithms on words
7	Sérgio A. D. Deusdado, Paulo M. M. Carvalho	SimSearch: A New Variant of Dynamic Programming Based on Distance Series for Optimal and Near-Optimal Similarity Discovery in Biological Sequences.	IWPACBB	2008	DBLP DOI BibTeX RDF	Similarity discovery, distance series, dynamic programming
7	Leena Salmela, Jorma Tarhio, Jari Kytöjoki	Multipattern string matching with q-grams.	ACM J. Exp. Algorithmics	2006	DBLP DOI BibTeX RDF	Content scanning, multiple string matching, intrusion detection
7	Jari Kytöjoki, Leena Salmela, Jorma Tarhio	Tuning String Matching for Huge Pattern Sets.	CPM	2003	DBLP DOI BibTeX RDF
7	Heikki Hyyrö	Bit-Parallel Approximate String Matching Algorithms with Transposition.	SPIRE	2003	DBLP DOI BibTeX RDF
7	Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro 0001, Yoan J. Pinzón	A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.	SPIRE	2003	DBLP DOI BibTeX RDF
7	Kimmo Fredriksson	Faster String Matching with Super-Alphabets.	SPIRE	2002	DBLP DOI BibTeX RDF
7	Gonzalo Navarro 0001, Ricardo A. Baeza-Yates	Improving an Algorithm for Approximate Pattern Matching.	Algorithmica	2001	DBLP DOI BibTeX RDF
7	James D. Roberts	A New Parallelization of Subgraphs Isomorphism Refinement for Classification and Retrieval of Conceptual Structures.	ICCS	1995	DBLP DOI BibTeX RDF