Search results for "Approximate"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	Haralampos Tsaknakis, Paul G. Spirakis	An Optimization Approach for Approximate Nash Equilibria.	WINE	2007	DBLP DOI BibTeX RDF
20	Xuli Han	Approximate Interpolation by Neural Networks with the Inverse Multiquadric Functions.	ISICA	2007	DBLP DOI BibTeX RDF
20	Emanuele Viola	On Approximate Majority and Probabilistic Time.	CCC	2007	DBLP DOI BibTeX RDF
20	Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiaohui Yu 0001	Reasoning About Approximate Match Query Results.	ICDE	2006	DBLP DOI BibTeX RDF
20	Sunil Arya, Theocharis Malamatos, David M. Mount	The effect of corners on the complexity of approximate range searching.	SCG	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
20	Di Wang, Guoren Wang, Qingquan Wu, Baichen Chen, Yi Zhao	A New Method for Finding Approximate Repetitions in DNA Sequences.	WAIM	2006	DBLP DOI BibTeX RDF
20	Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack	Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.	MFCS	2006	DBLP DOI BibTeX RDF
20	Jason Crampton, Wing Leung, Konstantin Beznosov	The secondary and approximate authorization model and its application to Bell-LaPadula policies.	SACMAT	2006	DBLP DOI BibTeX RDF	Bell-LaPadula model, authorization recycling, access control, SAAM
20	Tor Dokken, Jan B. Thomassen	Weak Approximate Implicitization.	SMI	2006	DBLP DOI BibTeX RDF
20	Davide Bilò, Luciano Gualà, Guido Proietti	On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.	SIROCCO	2006	DBLP DOI BibTeX RDF
20	Jason B. Peltzer, Ankur Teredesai, Garrett Reinard	AQUAGP: Approximate QUery Answers Using Genetic Programming.	EuroGP	2006	DBLP DOI BibTeX RDF
20	Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó	Approximate radical of ideals with clusters of roots.	ISSAC	2006	DBLP DOI BibTeX RDF
20	Yongge Wang, Xintao Wu	Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation.	ICDM	2005	DBLP DOI BibTeX RDF	inverse frequent itemset mining, data mining, privacy, complexity
20	Zheng Liu, Xin Chen 0037, James Borneman, Tao Jiang 0001	A Fast Algorithm for Approximate String Matching on Gene Sequences.	CPM	2005	DBLP DOI BibTeX RDF
20	Stéphane Zampelli, Yves Deville, Pierre Dupont	Approximate Constrained Subgraph Matching.	CP	2005	DBLP DOI BibTeX RDF
20	Dazhou Kang, Hanwu Chen, Baowen Xu, Jianjiang Lu, Keyue Li, William C. Chu	Approximate Information Retrieval for Heterogeneity Ontologies.	CW	2005	DBLP DOI BibTeX RDF
20	Martin Gavrilov, Piotr Indyk, Rajeev Motwani 0001, Suresh Venkatasubramanian	Combinatorial and Experimental Methods for Approximate Point Pattern Matching.	Algorithmica	2004	DBLP DOI BibTeX RDF
20	Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell 0001	An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.	FoSSaCS	2003	DBLP DOI BibTeX RDF
20	Brian Babcock, Surajit Chaudhuri, Gautam Das 0001	Dynamic Sample Selection for Approximate Query Processing.	SIGMOD Conference	2003	DBLP DOI BibTeX RDF
20	Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu	Approximate String Matching in DNA Sequences.	DASFAA	2003	DBLP DOI BibTeX RDF
20	Jiong Yang 0001, Wei Wang 0010, Yi Xia, Philip S. Yu	Accelerating Approximate Subsequence Search on Large Protein Sequence Databases.	CSB	2002	DBLP DOI BibTeX RDF
20	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-efficient approximate Voronoi diagrams.	STOC	2002	DBLP DOI BibTeX RDF
20	Q. Su, Venkataramanan Balakrishnan, Cheng-Kok Koh	Efficient Approximate Balanced Truncation of General Large-Scale RLC Systems via Krylov Methods.	ASP-DAC/VLSI Design	2002	DBLP DOI BibTeX RDF	Krylov, large scale systems, model reduction, RLC interconnects, balanced truncation
20	Kouta Kanda, Makoto Haraguchi, Yoshiaki Okubo	Constructing Approximate Informative Basis of Association Rules.	Discovery Science	2001	DBLP DOI BibTeX RDF
20	Weiping Zhu 0001	An approximate analysis of the shortest queue policy on soft real-time scheduling.	SIGMETRICS Perform. Evaluation Rev.	2000	DBLP DOI BibTeX RDF
20	Shyue-Liang Wang, Jenn-Shing Tsai	Discovery of approximate dependencies from proximity-based fuzzy databases.	KES	1999	DBLP DOI BibTeX RDF
20	Hai Wang 0008, Kenneth C. Sevcik	Experiments with Improved Approximate Mean Value Analysis Algorithms.	Computer Performance Evaluation (Tools)	1998	DBLP DOI BibTeX RDF
20	Shiva Chaudhuri, Torben Hagerup, Rajeev Raman	Approximate and Exact Deterministic Parallel Selection.	MFCS	1993	DBLP DOI BibTeX RDF
20	John Zahorjan, Edward D. Lazowska	Incorporating Load Dependent Servers in Approximate Mean Value Analysis.	SIGMETRICS	1984	DBLP DOI BibTeX RDF
20	Stefan Ratschan	Convergent approximate solving of first-order constraints by approximate quantifiers.	ACM Trans. Comput. Log.	2004	DBLP DOI BibTeX RDF	constraints, Decision procedures, real numbers, generalized quantifiers
20	Liguo Jiao, Jae-Hyoung Lee	Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs.	J. Optim. Theory Appl.	2018	DBLP DOI BibTeX RDF
20	Dominik Slezak	Toward Approximate Intelligence: Approximate Query Engines & Approximate Data Exploration.	WWW (Companion Volume)	2018	DBLP DOI BibTeX RDF
17	James Cheng, Yiping Ke, Wilfred Ng	A survey on algorithms for mining frequent itemsets over data streams.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Window models, Approximate algorithms, Frequent itemsets, Stream mining
17	Saoussen Bel Hadj Kacem, Amel Borgi, Khaled Ghédira	Generalized Modus Ponens Based on Linguistic Modifiers in a Symbolic Multi-Valued Framework.	ISMVL	2008	DBLP DOI BibTeX RDF	Generalized Modus Ponens, linguistic modifiers, symbolic multi-valued logic, Approximate reasoning
17	Vasundhara Puttagunta, Konstantinos Kalpakis	Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks.	Algorithmica	2007	DBLP DOI BibTeX RDF	Linear sketching, Sensor networks, Approximate query answering, In-network aggregation
17	Dongxia Sun, Lihong Zhi	Structured Low Rank Approximation of a Bezout Matrix.	Math. Comput. Sci.	2007	DBLP DOI BibTeX RDF	Bezout matrix, approximate greatest common divisor, structured nonlinear total least squares, symbolic/numeric hybrid method
17	Alfredo Cuzzocrea	An accuracy-aware compression technique for multidimensional data cubes.	SAC	2006	DBLP DOI BibTeX RDF	data compression techniques, OLAP, approximate query answering
17	Davide Bilò, Luciano Gualà, Guido Proietti	Dynamic Mechanism Design.	WINE	2006	DBLP DOI BibTeX RDF	On-line Problems, Approximate Mechanisms, Dynamic Algorithms, Algorithmic Mechanism Design
17	Anja Klein 0001, Rainer Gemulla, Philipp Rösch, Wolfgang Lehner	Derby/S: a DBMS for sample-based query answering.	SIGMOD Conference	2006	DBLP DOI BibTeX RDF	sampling, approximate query answering
17	Lucian Ilie, Liviu Tinta, Cristian Popescu, Kathleen A. Hill	Viral Genome Compression.	DNA	2006	DBLP DOI BibTeX RDF	viral genomes, genome compression, overlapping genes, shortest common superstring problem, lower bounds, exact algorithms, viruses, approximate solutions
17	Nicos Karcanias, Marilena Mitrouli, Dimitrios Triantafyllou	A Hybrid Approach for Normal Factorization of Polynomials.	International Conference on Computational Science (2)	2006	DBLP DOI BibTeX RDF	Polynomials, factorization, greatest common divisor, approximate computations
17	Villy Bæk Iversen, Sergey N. Stepanov, A. V. Kostrov	Dimensioning of Multiservice Links Taking Account of Soft Blocking.	NEW2AN	2006	DBLP DOI BibTeX RDF	approximate algorithms, wireless, CDMA, dimensioning, trunk reservation, teletraffic, soft blocking
17	Richard Cole 0001, Lee-Ad Gottlieb	Searching dynamic point sets in spaces with bounded doubling dimension.	STOC	2006	DBLP DOI BibTeX RDF	approximate nearest neighbor search
17	Gergely Korodi, Ioan Tabus	An efficient normalized maximum likelihood algorithm for DNA sequence compression.	ACM Trans. Inf. Syst.	2005	DBLP DOI BibTeX RDF	Approximate sequence matching, DNA compression, normalized maximum likelihood model
17	Yan-Wen Guo 0001, Jin Wang, Xiufen Cui, Qunsheng Peng 0001	A New Constrained Texture Mapping Method.	ICEC	2005	DBLP DOI BibTeX RDF	Approximate shortest path, Texture mapping, Morphing
17	Luciano Gualà, Guido Proietti	A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals.	COCOON	2005	DBLP DOI BibTeX RDF	Approximate Truthful Mechanisms, Algorithmic Mechanism Design, Steiner Tree Problem, Selfish Agents
17	Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos	Multi-Way Distance Join Queries in Spatial Databases.	GeoInformatica	2004	DBLP DOI BibTeX RDF	distance join queries, spatial databases, R-trees, branch-and-bound algorithms, approximate techniques
17	Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni	Locality-sensitive hashing scheme based on p-stable distributions.	SCG	2004	DBLP DOI BibTeX RDF	p-stable distributions, locally sensitive hashing, sublinear algorithm, approximate nearest neighbor
17	Paolo Penna, Carmine Ventre	Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.	PE-WASUN	2004	DBLP DOI BibTeX RDF	light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees
17	Sarajane Marques Peres, Márcio Luiz De Andrade Netto	A Fractal Fuzzy Approach to Clustering Tendency Analysis.	SBIA	2004	DBLP DOI BibTeX RDF	Clustering Tendency Analysis, Fractal Dimension Theory, Fuzzy Approximate Reasoning
17	Zheng Zheng 0001, Hong Hu 0001, Zhongzhi Shi	Rough Set Based Image Texture Recognition Algorithm.	KES	2004	DBLP DOI BibTeX RDF	Rough Set, Image Texture, Approximate Space
17	Sudipto Guha, Dimitrios Gunopulos, Nick Koudas	Correlating synchronous and asynchronous data streams.	KDD	2003	DBLP DOI BibTeX RDF	data streams, singular value decomposition, approximate computation
17	Ela Hunt, Malcolm P. Atkinson 0001, Robert W. Irving	Database indexing for large DNA and protein sequence collections.	VLDB J.	2002	DBLP DOI BibTeX RDF	Suffix tree, Approximate matching, Database index, Biological sequence
17	Ertem Tuncel, Hakan Ferhatosmanoglu, Kenneth Rose	VQ-index: an index structure for similarity searching in multimedia databases.	ACM Multimedia	2002	DBLP DOI BibTeX RDF	approximate similarity searching, retrieved information reduction, retrieved set reduction, clustering, indexing, vector quantization
17	Maria I. Sessa	Translations and similarity-based logic programming.	Soft Comput.	2001	DBLP DOI BibTeX RDF	Logic Programming, Abstract interpretation, Approximate reasoning, Galois connection, Similarity relation
17	Kian-Lee Tan, Cheng Hian Goh, Beng Chin Ooi	Progressive evaluation of nested aggregate queries.	VLDB J.	2000	DBLP DOI BibTeX RDF	Nested aggregate queries, Approximate answers, Progressive query processing, Multi-threading, Online aggregation
17	Grace SauLan Loo, Kok-Huat Lee	An Interface to Databases for Flexible Query Answering: A Fuzzy-Set Approach.	DEXA	2000	DBLP DOI BibTeX RDF	alpha-cut, design, interface, approximate, flexibility, fuzzy, linguistic, imprecise, query modification
17	Maritza Bracho de Rodríguez, José Alí Moreno	Heuristic Algorithm for Robot Path Planning Based on Real Space Renormalization.	IBERAMIA-SBIA	2000	DBLP DOI BibTeX RDF	Real Space Renormalization, Approximate Cell Decomposition, Path Planning, Heuristic Algorithm
17	Bruno Carpentieri, Iain S. Duff, Luc Giraud	Robust Preconditioning of Dense Problems from Electromagnetics.	NAA	2000	DBLP DOI BibTeX RDF	Preconditioning techniques, sparse approximate inverses, nonzero pattern selection strategies, electromagnetic scattering applications, AMS subject classification: 65F10, 78A45, 78A50, 78-08, 65R20, 65F50, 65N38
17	Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón	Fast Evolutionary Chains.	SOFSEM	2000	DBLP DOI BibTeX RDF	computer-assisted music analysis, dynamic programming, approximate string matching, String algorithms
17	Ramón Alberto Mollineda, Enrique Vidal 0001, Francisco Casacuberta	Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns.	SSPR/SPR	2000	DBLP DOI BibTeX RDF	cyclic patterns, cyclic strings, structural pattern analysis, 2d shape recognition, approximate string matching
17	Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski	Pattern Matching Image Compression: Algorithmic and Empirical Results.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	Lossy Lempel-Ziv scheme, generalized Shannon entropy, Hamming and square root distortion, algorithms on words, Fast Fourier Transform, image compression, approximate pattern matching
17	Arcot Rajasekar	String-Oriented Databases.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	query processing, pattern-matching, datalog, relational algebra, approximate reasoning
17	Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang	A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.	ISPAN	1999	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
17	Hsi-Chieh Lee, Fikret Erçal	RMESH Algorithms for Parallel String Matching.	ISPAN	1997	DBLP DOI BibTeX RDF	Reconfigurable Mesh Architecture, RMESH, Parallel Algorithms, String Matching, Approximate String Matching
17	Michael Minock, Wesley W. Chu	Explanation for Cooperative Information Systems.	ISMIS	1996	DBLP DOI BibTeX RDF	Approximate Answers, CoBase, Explanation, Knowledge Integration, Intelligent Information Systems, Dialogue Management, Cooperative Information Systems
17	Hagit Attiya, Nancy A. Lynch, Nir Shavit	Are Wait-Free Algorithms Fast?	J. ACM	1994	DBLP DOI BibTeX RDF	approximate agreement, fault-tolerance, wait-free
17	Yves Dallery, Stanley B. Gershwin	Manufacturing flow line systems: a review of models and analytical results.	Queueing Syst. Theory Appl.	1992	DBLP DOI BibTeX RDF	Manufacturing flow line systems, modelling, performance, evaluation, failures, blocking, analytical methods, approximate analysis, exact analysis
17	Anthony E. Krzesinski, J. Greyling	Improved Lineariser Methods for Queueing Networks with Queue Dependent Centres.	SIGMETRICS	1984	DBLP DOI BibTeX RDF	Product from solutions, Error analysis, Mean value analysis, Approximate solutions, Multiclass queueing networks
17	Dalie Sun, Sai Wu, Shouxu Jiang, Jianzhong Li 0001	Approximate Aggregations in Structured P2P Networks.	IEEE Trans. Knowl. Data Eng.	2011	DBLP DOI BibTeX RDF	BATON, Peer-to-Peer, approximate query processing
17	René Brunner, Felix Freitag, Leandro Navarro 0001	Self-Regulated Trade-Off among Timeliness, Messages and Accuracy for Approximate Queries in Large-Scale Information Aggregation.	NBiS	2011	DBLP DOI BibTeX RDF	Large-scale Information Aggregation, Computational Grids and Clouds, Autonomic Management, Approximate Queries
17	Taijin Yoon, Sun-Young Park, Hwan-Gue Cho	A Smart Filtering System for Newly Coined Profanities by Using Approximate String Alignment.	CIT	2010	DBLP DOI BibTeX RDF	profanity filter, sequence alignment, approximate string matching
17	Wing-Kai Hon, Winson Wu, Ting-Shuo Yang	Compressed Indexes for Approximate Library Management.	DCC	2010	DBLP DOI BibTeX RDF	compressed index, library management, suffix array, approximate matching
17	Dan Gutfreund, Akinori Kawachi	Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.	CCC	2010	DBLP DOI BibTeX RDF	Arthur-Merlin protocols, derandomization, circuit complexity, approximate counting
17	Jinghui Zhang, Junzhou Luo, Zhiang Wu 0001	A Novel Approximate Algorithm for Admission Control.	FAW	2009	DBLP DOI BibTeX RDF	approximate algorithm, admission control, local ratio, multiple resources
17	Hong Shen 0001, Yu Zhang	Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	data stream, bloom filter, sliding window, duplicate detection, approximate query
17	Zi Huang, Heng Tao Shen, Xiaofang Zhou 0001	Localized Co-Occurrence Model for Fast Approximate Search in 3D Structure Databases.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF	Simialrity Search, Structural and Statistical Database, Approximate Search
17	Jun-hong Hu, Ying-jie Lei	Techniques for Approximate Reasoning Based on Intuitionistic Fuzzy S-Rough Logic.	PACIIA (1)	2008	DBLP DOI BibTeX RDF	Intuitionistic Fuzzy S-Rough sets, Intuitionistic Fuzzy S-Rough Logic, approximate reasoning
17	Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc	Helly-type theorems for approximate covering.	SCG	2008	DBLP DOI BibTeX RDF	3d visibility, approximate covering, helly-type theorems, lp-type problems
17	Kaushik Chakrabarti, Surajit Chaudhuri, Venkatesh Ganti, Dong Xin	An efficient filter for approximate membership checking.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	approximate membership checking, filtering, string match
17	Yalin Zheng, Guang Yang 0002, Changshui Zhang, Jing Zheng, Yunpeng Xu	Equivalence Knowledge Mass and Approximate Reasoning in -Logic (I).	ICIC (2)	2008	DBLP DOI BibTeX RDF	Knowledge Cumularspharolith, Formulae Cumularspharolith, Approximate Knowledge Closure of Knowledge Base, Pseudo-distance, automatic Reasoning System, completeness
17	Filip Korc, Wolfgang Förstner	Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation.	DAGM-Symposium	2008	DBLP DOI BibTeX RDF	Approximate parameter learning, pseudo-likelihood, Markov Random Field, Conditional Random Field
17	Joachim von zur Gathen, Igor E. Shparlinski	Approximate Polynomial gcd: Small Degree and Small Height Perturbations.	LATIN	2008	DBLP DOI BibTeX RDF	Euclidean algorithm, gcd, approximate computation
17	Nedialko B. Dimitrov, Indrajit Roy 0001	A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster.	SPAA	2008	DBLP DOI BibTeX RDF	approximate core equilibrium, facility location, resource augmentation, primal-dual
17	Arianna D'Ulizia, Fernando Ferri, Patrizia Grifoni	Approximate Queries by Relaxing Structural Constraints in GIS.	ER Workshops	2007	DBLP DOI BibTeX RDF	Geographical information systems, semantic similarity, structural similarity, approximate queries
17	Patrick Doherty 0001, Barbara Dunin-Keplicz, Andrzej Szalas	Dynamics of Approximate Information Fusion.	RSEISP	2007	DBLP DOI BibTeX RDF	information fusion, approximate reasoning, similarity relation
17	Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi	Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).	SNC	2007	DBLP DOI BibTeX RDF	hybrid method, SDP, approximate factorization
17	Oswald Lanz	Approximate Bayesian Multibody Tracking.	IEEE Trans. Pattern Anal. Mach. Intell.	2006	DBLP DOI BibTeX RDF	Bayes filter, Computer vision, tracking, particle filter, occlusion, approximate inference
17	Amol Deshpande, Carlos Guestrin, Samuel Madden 0001, Joseph M. Hellerstein, Wei Hong 0001	Model-based approximate querying in sensor networks.	VLDB J.	2005	DBLP DOI BibTeX RDF	Conditional plans, Model-driven data acquisition, Sensor networks, Probabilistic models, Approximate querying
17	Renato Bueno, Agma J. M. Traina, Caetano Traina Jr.	Accelerating approximate similarity queries using genetic algorithms.	SAC	2005	DBLP DOI BibTeX RDF	genetic algorithms, similarity queries, approximate queries, metric access methods
17	Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum	The Relative Complexity of Approximate Counting Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Computational complexity, Approximate counting
17	Erich L. Kaltofen, John P. May	On approximate irreducibility of polynomials in several variables.	ISSAC	2003	DBLP DOI BibTeX RDF	absolute irreducibility, effective Noether irreducibility forms, multivariate polynomial factorization, radius of irreducibility, approximate factorization, symbolic/numeric hybrid method
17	Venkatesan Guruswami, Johan Håstad, Madhu Sudan 0001	Hardness of Approximate Hypergraph Coloring.	FOCS	2000	DBLP DOI BibTeX RDF	approximate hypergraph coloring, covering complexity, probabilistic verifier, PCP verifier, 2-colorable 4-uniform hypergraph, hardness assumption, computational complexity, computational geometry, minimisation, graph colouring, hardness, minimization problems
17	Kimmo Fredriksson, Esko Ukkonen	Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays.	SPIRE	2000	DBLP DOI BibTeX RDF	combinatorial methods, 3D arrays, three-dimensional pattern, three-dimensional volume, biological virus, pattern matching, translations, rotations, distance measures, voxels, incremental algorithms, minimum distance, three dimensional reconstruction, filtering algorithms, approximate pattern matching, real data
17	Sung-Hyuk Cha, Yong-Chul Shin, Sargur N. Srihari	Approximate Stroke Sequence String Matching Algorithm for Character Recognition and Analysis.	ICDAR	1999	DBLP DOI BibTeX RDF	Pattern Matching, Character Recognition, Approximate String Matching, Handwriting Analysis, Chain-code
17	Felice Balarin	Approximate reachability analysis of timed automata.	RTSS	1996	DBLP DOI BibTeX RDF	approximate reachability analysis, unsafe states, incorrect system, discrete state components, real-time systems, formal verification, Boolean functions, computation, timed automata, finite automata, finite state automata, timing information
17	Ton Sales	From Pure to Approximate Logic.	ISMVL	1996	DBLP DOI BibTeX RDF	approximate logic, theoretician, abstract methods, Helena Rasiowa, artificial intelligence, computer science, formal logic, bibliographies, biographies
17	Eric Schenk	Faster Approximate Agreement with Multi-Writer Registers.	FOCS	1995	DBLP DOI BibTeX RDF	multi-writer registers, wait-free approximate agreement problem, asynchronous shared memory, single-bit multi-writer multi-reader registers, wait-free single-writer multi-reader, wait-free multi-writer multi-reader, computational complexity, complexity, distributed algorithms, lower bounds, shared memory systems, upper bounds, shared registers
17	M. W. Du, S. C. Chang	An Approach to Designing Very Fast Approximate String Matching Algorithms.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	fast approximate string matching algorithms, spelling errors, four-step reduction procedure, library book catalog textbase, large dictionary, multiple fault model, information retrieval, query processing, fault model, database theory, error correction, error correction, search problems, dictionary, nearest neighbor search, character strings, sequential computer, hashing techniques
17	David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001	Approximate Graph Coloring by Semidefinite Programming	FOCS	1994	DBLP DOI BibTeX RDF	approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio