Search results for "candidate"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
57	Yuanxiang Li, Chew Lim Tan, Xiaoqing Ding	A hybrid post-processing system for offline handwritten Chinese script recognition.	Pattern Anal. Appl.	2005	DBLP DOI BibTeX RDF	Contextual post-processing, Candidate confidence, Candidate set size, Statistical language model, Chinese character recognition, Perplexity
53	Lawrence E. Bassham III	Efficiency Testing of ANSI C Implementations of Round 2 Candidate Algorithms for the Advanced Encryption Standard.	AES Candidate Conference	2000	DBLP BibTeX RDF
53	Adam J. Elbirt, W. Yip, B. Chetwynd, Christof Paar	An FPGA Implementation and Performance Evaluation of the AES Block Cipher Candidate Algorithm Finalists.	AES Candidate Conference	2000	DBLP BibTeX RDF
53	Bruce Schneier, John Kelsey, Doug Whiting, David A. Wagner 0001, Niels Ferguson	Comments on Twofish as an AES Candidate.	AES Candidate Conference	2000	DBLP BibTeX RDF
53	Andreas Sterbenz, Peter Lipp	Performance of the AES Candidate Algorithms in Java.	AES Candidate Conference	2000	DBLP BibTeX RDF
48	Toru Hisamitsu, Katsumi Marukawa, Yoshihiro Shima, Hiromichi Fujisawa, Yoshihiko Nitta	Optimal techniques in OCR error correction for Japanese texts.	ICDAR	1995	DBLP DOI BibTeX RDF	OCR error correction, Japanese texts, candidate word extraction, candidate character lattice, optimal word entries, Japanese verb inflection analysis, word matching cost calculation, linguistic criteria, chart parsing computation, optical character recognition, error correction, grammars, optimal techniques, optimal method, morphological analysis
47	Hang Su, Qiaozhu Mei	Template extraction from candidate template set generation: a structure and content approach.	ACM Southeast Regional Conference (2)	2005	DBLP DOI BibTeX RDF	candidate template set, table informativeness, template extraction, structure similarity
44	M. Braun, Martin Hahn 0001, Jens-Rainer Ohm, Maati Talmi	Motion-Compensating Real-Time Format Converter for Video on Multimedia Displays.	ICIP (1)	1997	DBLP DOI BibTeX RDF	motion-compensating real-time format converter, multimedia displays, interlaced TV signals, progressive display formats, frame repetition rate, motion compensated filtering, candidate vector, temporal predecessors, spatial predecessors, DFD error criterion, optimal candidate, pixel recursive steps, fallback mode, single-chip integration, displayed field differences error criterion, motion estimation, motion estimation, video, median filter
41		The Third Advanced Encryption Standard Candidate Conference, April 13-14, 2000, New York, New York, USA.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Bryan Weeks, Mark Bean, Tom Rozylowicz, Chris Ficke	Hardware Performance Simulations of Round 2 Advanced Encryption Standard Algorithms.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	John Worley, Bill Worley, Tom Christian, Christopher Worley	AES Finalists on PA-RISC and IA-64: Implementations & Performance.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Nicholas Weaver, John Wawrzynek	A Comparison of the AES Candidates Amenability to FPGA Implementation.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Kazumaro Aoki, Helger Lipmaa	Fast Implementations of AES Candidates.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Dag Arne Osvik	Speeding up Serpent.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Jim Dray	NIST Performance Analysis of the Final Round JavaTM AES Candidates.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Makoto Sugita, Kazukuni Kobara, Kazuhiro Uehara, Shuji Kubota, Hideki Imai	Relationships among Differential, Truncated Differential, Impossible Differential Cryptanalyses against Word-Oriented Block Ciphers like RIJNDAEL, E2.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Don B. Johnson	AES and Future Resiliency: More Thoughts and Questions.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Tadayoshi Kohno, John Kelsey, Bruce Schneier	Preliminary Cryptanalysis of Reduced-Round Serpent.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Akashi Satoh, Nobuyuki Ooba, Kohji Takano, Edward D'Avignon	High-Speed MARS Hardware.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Eli Biham, Vladimir Furman	Impossible Differential on 8-Round MARS' Core.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Ronald L. Rivest, Matthew J. B. Robshaw, Yiqun Lisa Yin	RC6 as the AES.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Stefan Lucks	Attacking Seven Rounds of Rijndael under 192-bit and 256-bit Keys.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Ian Harvey	The Effects of Multiple Algorithms in the Advanced Encryption Standard.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Henri Gilbert, Marine Minier	A Collision Attack on 7 Rounds of Rijndael.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Don Coppersmith, Rosario Gennaro, Shai Halevi, Charanjit S. Jutla, Stephen M. Matyas, Mohammad Peyravian, David Safford, Nevenko Zunic	IBM Comments.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	John Kelsey, Bruce Schneier	MARS Attacks! Preliminary Cryptanalysis of Reduced-Round MARS Variants.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Richard Weiss 0001, Nathan L. Binkert	A Comparison of AES Candidates on the Alpha 21264.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Kris Gaj, Pawel Chodowiec	Comparison of the Hardware Performance of the AES Candidates Using Reconfigurable Hardware.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Thomas J. Wollinger, Min Wang, Jorge Guajardo, Christof Paar	How Well Are High-End DSPs Suited for the AES Algorithms? AES Algorithms on the TMS320C6x DSP.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Ross J. Anderson, Eli Biham, Lars R. Knudsen	The Case for Serpent.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Joan Daemen, Vincent Rijmen	Rijndael for AES.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Fumihiko Sano, Masanobu Koike, Shin-ichi Kawamura, Masue Shiba	Performance Evaluation of AES Finalists on the High-End Smart Card.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Tetsuya Ichikawa, Tomomi Kasuya, Mitsuru Matsui	Hardware Evaluation of the AES Finalists.	AES Candidate Conference	2000	DBLP BibTeX RDF
41	Bruce Schneier, Doug Whiting	A Performance Comparison of the Five AES Finalists.	AES Candidate Conference	2000	DBLP BibTeX RDF
39	He Jiang, Yudong Chen	An efficient algorithm for generalized minimum spanning tree problem.	GECCO	2010	DBLP DOI BibTeX RDF	candidate set, generalized minimum spanning tree, local search
39	Watson Wei Khong Chua, Angela Eck Soong Goh	Candidate reduction and alignment improvement techniques used in aligning ontologies.	iiWAS	2009	DBLP DOI BibTeX RDF	alignment improvement, candidate reduction, mapping, survey, matching, ontology alignment
39	Jun Zhang, Zhaohui Peng, Shan Wang 0001, Huijing Nie	CLASCN: Candidate Network Selection for Efficient Top- k Keyword Queries over Databases.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	candidate network, relational database, keyword search, top-k query
38	Hongbo Li, Li Zhou	Use Closure of Relevant Sets of Attributes to Efficiently Find Candidate Keys.	CSSE (1)	2008	DBLP DOI BibTeX RDF
38	Hisao Ishibuchi, Isao Kuwajima, Yusuke Nojima	Use of Pareto-Optimal and Near Pareto-Optimal Candidate Rules in Genetic Fuzzy Rule Selection.	Analysis and Design of Intelligent Systems using Soft Computing Techniques	2007	DBLP DOI BibTeX RDF
35	Vincent S. Tseng, Cheng-Wei Wu, Bai-En Shie, Philip S. Yu	UP-Growth: an efficient algorithm for high utility itemset mining.	KDD	2010	DBLP DOI BibTeX RDF	candidate pruning, high utility itemset, frequent itemset, utility mining
35	Yuanxiang Li, Xiaoqing Ding, Chew Lim Tan	Combining character-based bigrams with word-based bigrams in contextual postprocessing for Chinese script recognition.	ACM Trans. Asian Lang. Inf. Process.	2002	DBLP DOI BibTeX RDF	contextual post-processing, efficiency of candidate set, forward-backward search, statistical language model, Chinese character recognition
34	Mahsa Armaghan, Abolfazl Toroghi Haghighat	QoS Multicast Routing Algorithms Based on Tabu Search with Hybrid Candidate List.	FGIT	2009	DBLP DOI BibTeX RDF	Candidate list strategy, Dynamic tabu tenure, Quality-of-Service, Tabu Search, Multicast Routing
34	Mariusz Boryczka	Ant Colony Programming with the Candidate List.	KES-AMSTA	2008	DBLP DOI BibTeX RDF	ant colony programming, candidate list, symbolic regression, ant colony system
34	Cheng-Lin Liu, Masaki Nakagawa	Precise Candidate Selection for Large Character Set Recognition by Confidence Evaluation.	IEEE Trans. Pattern Anal. Mach. Intell.	2000	DBLP DOI BibTeX RDF	large character set, candidate selection, confidence evaluation, Bayesian inference, Handwritten character recognition
33	Hisao Ishibuchi, Isao Kuwajima, Yusuke Nojima	Prescreening of Candidate Rules Using Association Rule Mining and Pareto-optimality in Genetic Rule Selection.	KES (2)	2007	DBLP DOI BibTeX RDF	genetic rule selection, multiobjective machine learning, Data mining, evolutionary multiobjective optimization, classifier design
30	Wei-Cheng Liao, Don-Lin Yang, Jungpin Wu, Ming-Chuan Hung	Fast and Effective Generation of Candidate-Sequences for Sequential Pattern Mining.	NCM	2009	DBLP DOI BibTeX RDF	candidate generation, minimum support, data mining, sequential pattern
29	Craig Macdonald, David Hannah, Iadh Ounis	High Quality Expertise Evidence for Expert Search.	ECIR	2008	DBLP DOI BibTeX RDF
29	Takahiko Shintani, Masaru Kitsuregawa	Parallel Generalized Association Rule Mining on Large Scale PC Cluster.	Large-Scale Parallel Data Mining	1999	DBLP DOI BibTeX RDF
29	Ken Kennedy, Ulrich Kremer	Automatic Data Layout for Distributed-Memory Machines.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	high performance Fortran
29	Tyler Lu, Craig Boutilier	The unavailable candidate model: a decision-theoretic view of social choice.	EC	2010	DBLP DOI BibTeX RDF	voting, preferences, rank aggregation, social choice
29	Faqir Zarrar Yousaf, Christian Müller 0004, Christian Wietfeld	Multi-hop discovery of Candidate Access Routers (MHD-CAR) for fast moving mobile nodes.	PIMRC	2008	DBLP DOI BibTeX RDF
29	Justin Donaldson, William R. Hazlewood	Candidate Mapping: Finding Your Place Amongst the Candidates.	IV	2008	DBLP DOI BibTeX RDF
29	Youzheng Wu, Xinhui Hu, Hideki Kashioka	Mining redundancy in candidate-bearing snippets to improve web question answering.	CIKM	2007	DBLP DOI BibTeX RDF	support vector machine, language model, question answering, data redundancy
29	Xiaofeng Yang 0001, Jian Su, Chew Lim Tan	A Twin-Candidate Model of Coreference Resolution with Non-Anaphor Identification Capability.	IJCNLP	2005	DBLP DOI BibTeX RDF
29	Doron Rotem, Kurt Stockinger, Kesheng Wu	Optimizing candidate check costs for bitmap indices.	CIKM	2005	DBLP DOI BibTeX RDF	dynamic programming, query processing, bitmap index
29	Yizhou Xie, Xujing Wang	Analysis of Population Dynamics in Beta-Cell Destruction Lead to Identification of Novel Candidate Genes for Type 1 Diabetes.	CSB	2004	DBLP DOI BibTeX RDF
26	Navneet Goyal, Yashvardhan Sharma	New binning strategy for bitmap indices on high cardinality attributes.	Bangalore Compute Conf.	2009	DBLP DOI BibTeX RDF	candidate checks, equi-width binning, bitmap index, binning
26	Min-Chul Park, Kyung Joo Cheoi	A perceptive viewpoint controller for the Free-Viewpoint TV.	ICIS	2009	DBLP DOI BibTeX RDF	FTV, candidate, controller, attention, viewpoint
26	Shuying Yan, Yanbo Han, Jing Wang 0002, Chen Liu, Guiling Wang 0002	A User-Steering Exploratory Service Composition Approach.	IEEE SCC (1)	2008	DBLP DOI BibTeX RDF	user-steering, exploratory service composition, candidate path generation
26	Martin Theobald, Ralf Schenkel, Gerhard Weikum	Efficient and self-tuning incremental query expansion for top-k query processing.	SIGIR	2005	DBLP DOI BibTeX RDF	incremental merge, probabilistic candidate pruning, top-k ranking, query expansion
26	Yi-Hong Tseng, Chi-Chang Kuo, Hsi-Jian Lee	Speeding-up Chinese Character Recognition in an Automatic Document Reading System.	ICDAR	1997	DBLP DOI BibTeX RDF	crossing-count features, contour-direction features, candidate-cluster selection, text-to-speech technique, automatic document-reading system, branch-and-bound method
26	John F. Cullen, Jonathan J. Hull, Peter E. Hart	Document image database retrieval and browsing using texture analysis.	ICDAR	1997	DBLP DOI BibTeX RDF	document image database retrieval, candidate search image, visual layout, fares, business letters, browsing, texture analysis, visual databases, newspapers, World Wide Web browser
26	R. Miller, Hal Carter, K. Davis, Satish Venkatesan	Hardware/software cosynthesis: multiple constraint satisfaction and component retrieval.	ICECCS	1996	DBLP DOI BibTeX RDF	hardware software cosynthesis, multiple constraint satisfaction, high-level system specification, constraint-driven retrieval, candidate solution evaluation, cosynthesis tool, multiple design constraints, two constraint Fidducia-Matheyses approach, flexible component retrieval, design database, ad hoc querying, systems analysis, hardware description language, design space, component retrieval
26	S. S. Skrzypkowiak, Vijay K. Jain	Affine motion estimation using a neural network.	ICIP	1995	DBLP DOI BibTeX RDF	affine motion estimation, translational movements, modified Hopfield neural network, affinity weights estimation, reconstructed macroblock, candidate macroblocks, full search algorithm, logarithmic block matching algorithms, neural network affine algorithm, synthetically sheared images, parallel network, motion estimation, motion estimation, image sequences, experiments, parameter estimation, parameter estimation, image reconstruction, video signal processing, VLSI implementation, PSNR, video frames, peak signal to noise ratio, Hopfield neural nets, single chip, translational motion, motion estimation algorithms, fault tolerant network
26	Yih-Tay Tsay, Wen-Hsiang Tsai	Attributed String Matching by Split-and-Merge for On-Line Chinese Character Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	attributed string matching, split-and-merge, stroke-based recognition approaches, correct stroke writing orders, candidate character selection, reference character, connected input strokes, dynamic programming, dynamic programming, character recognition, feasibility, Chinese character recognition
25	James Cheng, Yiping Ke, Wilfred Ng	Efficient query processing on graph databases.	ACM Trans. Database Syst.	2009	DBLP DOI BibTeX RDF	graph query processing, Graph databases, frequent subgraphs, graph indexing
25	Mohammad Mahdian, Randolph Preston McAfee, David M. Pennock	The Secretary Problem with a Hazard Rate Condition.	WINE	2008	DBLP DOI BibTeX RDF
25	James Cheng, Yiping Ke, Wilfred Ng, An Lu	Fg-index: towards verification-free query processing on graph databases.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	graph databases, frequent subgraphs, graph indexing, graph querying
25	Rashedur M. Rahman, Ken Barker 0001, Reda Alhajj	Study of Different Replica Placement and Maintenance Strategies in Data Grid.	CCGRID	2007	DBLP DOI BibTeX RDF
25	Jian Zhang 0004, Joan Feigenbaum	Finding highly correlated pairs efficiently with powerful pruning.	CIKM	2006	DBLP DOI BibTeX RDF	correlation, statistical computing, massive data set
25	Reda Alhajj, Ashraf Elnagar	Multiagents to Separating Handwritten Connected Digits.	IEEE Trans. Syst. Man Cybern. Part A	2005	DBLP DOI BibTeX RDF
25	Kun-Lung Wu, Philip S. Yu	Efficient query monitoring using adaptive multiple key hashing.	CIKM	2002	DBLP DOI BibTeX RDF	adaptive multiple key hashing, query monitoring, publish/subscribe, continual queries, query indexing
25	Jong Soo Park, Ming-Syan Chen, Philip S. Yu	An Effective Hash Based Algorithm for Mining Association Rules.	SIGMOD Conference	1995	DBLP DOI BibTeX RDF
25	Mohammad Shafkat Amin, Anupam Bhattacharjee, Russell L. Finley Jr., Hasan M. Jamil	A stochastic approach to candidate disease gene subnetwork extraction.	SAC	2010	DBLP DOI BibTeX RDF	disease genes, random walk, protein-protein interaction network
25	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
25	Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee	An Efficient Candidate Pruning Technique for High Utility Pattern Mining.	PAKDD	2009	DBLP DOI BibTeX RDF	high utility pattern mining, Data mining, association rules, knowledge discovery, frequent pattern mining
25	Bradley Wehrwein, Gilberto Matos, Rajanikanth Tanikella	A Requirements-Driven and Collaborative Decision Support Approach for Evaluating the Viability of Candidate Implementation Technologies.	EDOC	2008	DBLP DOI BibTeX RDF
25	Eun Sung Jeon, Yohan Kim, Dong Ku Kim	Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder.	FGCN (1)	2007	DBLP DOI BibTeX RDF
25	Masato Asahara, Akio Shimada, Hiroshi Yamada, Kenji Kono	Finding candidate spots for replica servers based on demand fluctuation.	ICPADS	2007	DBLP DOI BibTeX RDF
25	Sangmin Lee, Keecheon Kim	An Effective Local Repair Scheme Using Candidate Node and Hello Message in AODV.	ISPA Workshops	2007	DBLP DOI BibTeX RDF
25	Nele Dexters, Paul W. Purdom, Dirk Van Gucht	A probability analysis for candidate-based frequent itemset algorithms.	SAC	2006	DBLP DOI BibTeX RDF
25	Jiawei Han 0001, Jian Pei, Yiwen Yin, Runying Mao	Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach.	Data Min. Knowl. Discov.	2004	DBLP DOI BibTeX RDF	algorithm, data structure, performance improvements, frequent pattern mining, association mining
25	Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist	SQL based frequent pattern mining without candidate generation.	SAC	2004	DBLP DOI BibTeX RDF	SQL based mining algorithms, mining algorithms in SQL, data mining, frequent pattern mining, database mining
25	Charles J. Alpert, Milos Hrkic, Stephen T. Quay	A fast algorithm for identifying good buffer insertion candidate locations.	ISPD	2004	DBLP DOI BibTeX RDF	planning, global routing, buffer insertion, physical synthesis
25	Zina Ben-Miled, S. Li, Jesse Martin, Chavali Balagopalakrishna, Omran A. Bukhres, Robert J. Oppelt	Load Balancing: A Case Study of a Pharmaceutical Drug Candidate Database.	BIBE	2003	DBLP DOI BibTeX RDF
25	Tiffany Ya Tang, Pinata Winoto, Keith C. C. Chan	Scaling Down Candidate Sets Based on the Temporal Feature of Items for Improved Hybrid Recommendations.	ITWP	2003	DBLP DOI BibTeX RDF
25	Marcus Randall, James Montgomery 0001	Candidate Set Strategies for Ant Colony Optimisation.	Ant Algorithms	2002	DBLP DOI BibTeX RDF
25	Adam J. Elbirt, W. Yip, B. Chetwynd, Christof Paar	An FPGA-based performance evaluation of the AES block cipher candidate algorithm finalists.	IEEE Trans. Very Large Scale Integr. Syst.	2001	DBLP DOI BibTeX RDF
25	Geoffrey I. Webb	Candidate Elimination Criteria for Lazy Bayesian Rules.	Australian Joint Conference on Artificial Intelligence	2001	DBLP DOI BibTeX RDF	machine learning
25	Jiawei Han 0001, Jian Pei, Yiwen Yin	Mining Frequent Patterns without Candidate Generation.	SIGMOD Conference	2000	DBLP DOI BibTeX RDF
25	Mihai M. Lazarescu, Horst Bunke, Svetha Venkatesh	Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques.	SSPR/SPR	2000	DBLP DOI BibTeX RDF	machine learning, graph matching, graph isomorphism, c4.5, structural pattern recognition, database retrieval, database indexing
25	Chi Lap Yip, K. K. Loo, Ben Kao, David Wai-Lok Cheung, C. K. Cheng	LGen - A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule Mining.	PAKDD	1999	DBLP DOI BibTeX RDF	LGen, Data mining, association rules, lattice, Apriori
25	Raymond Fadous, John Forsyth	Finding Candidate Keys for Relational Data Bases.	SIGMOD Conference	1975	DBLP DOI BibTeX RDF
25	Huanran Zheng, Wei Zhu 0016, Pengfei Wang, Xiaoling Wang	Candidate Soups: Fusing Candidate Results Improves Translation Quality for Non-Autoregressive Translation.	CoRR	2023	DBLP DOI BibTeX RDF
25	Huanran Zheng, Wei Zhu 0016, Pengfei Wang, Xiaoling Wang	Candidate Soups: Fusing Candidate Results Improves Translation Quality for Non-Autoregressive Translation.	EMNLP	2022	DBLP DOI BibTeX RDF
25	Jie Cao 0014, Wei Ren, Hong Zhang, Zuohan Chen	Candidate box fusion based approach to adjust position of the candidate box for object detection.	IET Image Process.	2021	DBLP DOI BibTeX RDF
25	Xujin Chen, Minming Li, Chenhao Wang 0001	Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space.	AAAI	2020	DBLP DOI BibTeX RDF
25	Xujin Chen, Minming Li, Chenhao Wang 0001	Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces.	CoRR	2019	DBLP BibTeX RDF
25	Shyh-Rong Lay, Chao-Hao Lee, Nai-Jen Cheng, Chien-Cheng Tseng, Bor-Shenn Jeng, Pei-Yih Ting, Quen-Zong Wu, Miin-Luen Day	On-line chinese character recognition with effective candidate radical and candidate character selections.	Pattern Recognit.	1996	DBLP DOI BibTeX RDF
22	Fei-Ching Kuo, Tsong Yueh Chen, Huai Liu, Wing Kwong Chan	Enhancing adaptive random testing for programs with high dimensional input domains or failure-unrelated parameters.	Softw. Qual. J.	2008	DBLP DOI BibTeX RDF	Fixed-sized-candidate-set ART, High dimension problem, Failure-unrelated parameters, Software testing, Random testing, Adaptive random testing