Bin Ma Authors: Add personal information
Bibliometrics: publication history
 Average citations per article 10.08 Citation Count 887 Publication count 88 Publication years 1996-2016 Available for download 14 Average downloads per article 456.00 Downloads (cumulative) 6,384 Downloads (12 Months) 176 Downloads (6 Weeks) 21
SEARCH
ROLE
Author only
· Editor only
· All roles

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 87 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 87 Result page: 1 2 3 4 5 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 February 2016 Journal of Signal Processing Systems: Volume 82 Issue 2, February 2016 Publisher: Kluwer Academic Publishers Bibliometrics: Citation Count: 0 Total variability model has shown to be effective for text-independent speaker verification. It provisions a tractable way to estimate the so-called i-vector, which describes the speaker and session variability rendered in a whole utterance. In order to extract the local session variability that is neglected by an i-vector, local variability ... Keywords: Speaker recognition, Factor analysis, Session variability 2 January 2016 Algorithmica: Volume 74 Issue 1, January 2016 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 Given a set $$S = \{s_1, s_2, \ldots , s_n\}$$S={s1,s2,�,sn} of strings of equal length $$L$$L and an integer $$d$$d, the closest string problem (CSP) requires the computation of a string $$s$$s of length $$L$$L such that $$d(s, s_i) \le d$$d(s,si)≤d for each $$s_i \in S$$si�S, where $$d(s, s_i)$$d(s,si) is ... Keywords: Computational biology, The closest string problem, Fixed-parameter algorithms, Randomized algorithms 3 March 2014 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 11 Issue 2, March/April 2014 Publisher: IEEE Computer Society Press Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 43 Full text available: PDF Large-scale comparison or similarity search of genomic DNA and protein sequence is of fundamental importance in modern molecular biology. To perform DNA and protein sequence similarity search efficiently, seeding (or filtration) method has been widely used where only sequences sharing a common pattern or "seed" are subject to detailed comparison. ... Keywords: similarity search, spaced seeds, homology search 4 October 2012 Pattern Recognition Letters: Volume 33 Issue 13, October, 2012 Publisher: Elsevier Science Inc. Bibliometrics: Citation Count: 2 Feature transformation techniques have been widely investigated to reduce feature redundancy and to introduce additional discriminative information with the aim to improve the performance of automatic speech recognition (ASR). In this paper, we propose a novel method to obtain discriminative feature transformation based on output coding technique for speech recognition. ... Keywords: Feature transformation, Generalized discriminant analysis, Output coding, Speech recognition 5 May 2011 Journal of Combinatorial Optimization: Volume 21 Issue 4, May 2011 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 1 The marginal maximum likelihood method is a widely-used method for ancestral state reconstruction. Given an evolution model (a phylogeny tree and the edge mutation rates) and the extant states (states on leaves), the method computes efficiently the most likely ancestral state on the root. However, when the extant states are ... Keywords: Maximum likelihood method, Polynomial time approximation, Ancestral state reconstruction, Reconstruction accuracy 6 March 2011 IEEE Transactions on Audio, Speech, and Language Processing: Volume 19 Issue 3, March 2011 Publisher: IEEE Press Bibliometrics: Citation Count: 0 This paper studies a new technique that characterizes a speaker by the difference between the speaker and a cohort of background speakers in the form of feature-space maximum a posteriori linear regression (fMAPLR). The fMAPLR is a linear regression function that projects speaker dependent features to speaker independent ones, also ... Keywords: speaker recognition, Feature transform, maximum a posteriori, support vector machine (SVM) 7 October 2010 Journal on Computing and Cultural Heritage (JOCCH): Volume 3 Issue 2, September 2010 Publisher: ACM Bibliometrics: Citation Count: 1 Downloads (6 Weeks): 4,   Downloads (12 Months): 33,   Downloads (Overall): 403 Full text available: PDF The Chinese zither, called guqin, has existed for over 3,000 years and always played an important role in Chinese social history. An interesting but unfortunate fact is that the traditional notation of guqin music does not provide the duration information for each music note which requires the player to learn ... Keywords: feature selection, guqin music, Classification, support vector machine 8 July 2010 COCOON'10: Proceedings of the 16th annual international conference on Computing and combinatorics Publisher: Springer-Verlag Bibliometrics: Citation Count: 4 Given a set of n strings of length L and a radius d , the closest string problem asks for a new string t sol that is within a Hamming distance of d to each of the given strings. It is known that the problem is NP-hard and its optimization ... 9 February 2010 Algorithmica: Volume 56 Issue 2, February 2010 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 1 The longest common subsequence problem (LCS) and the closest substring problem (CSP) are two models for finding common patterns in strings, and have been studied extensively. Though both LCS and CSP are NP-Hard, they exhibit very different behavior with respect to polynomial time approximation algorithms. While LCS is hard to ... Keywords: Pattern matching and computational biology, Motif finding, Approximation algorithms, Longest common rigid subsequence, Longest common subsequence 10 December 2009 ROBIO'09: Proceedings of the 2009 international conference on Robotics and biomimetics Publisher: IEEE Press Bibliometrics: Citation Count: 0 Natural language interface is an important research topic in the area of natural language processing (NLP). Natural language interaction with robot could be the most natural and efficient way. In order to build speech enabled human language interface of robots, our research goal is to study the problems in this ... 11 December 2009 ICICS'09: Proceedings of the 7th international conference on Information, communications and signal processing Publisher: IEEE Press Bibliometrics: Citation Count: 0 In this paper, we propose a subspace construction and selection strategy (SUBS) for speaker recognition with limited training and testing speech data. Based on the individual Gaussian distributions of Gaussian mixture model (GMM), each speaker's characteristic subspace is constructed by training an SVM using the corresponding Gaussian mean vectors from ... 12 November 2009 Theoretical Computer Science: Volume 410 Issue 51, November, 2009 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 2 The shortest common superstring problem (SCS) has been extensively studied for its applications in string compression and DNA sequence assembly. Although the problem is known to be Max-SNP hard, the simple greedy algorithm performs extremely well in practice. To explain the good performance, previous researchers proved that the greedy algorithm ... Keywords: Smoothed analysis, Polynomial time approximation scheme, Shortest common superstring 13 October 2009 SIAM Journal on Computing: Volume 39 Issue 4, September 2009 Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 0 The closest string problem and the closest substring problem are all natural theoretical computer science problems and find important applications in computational biology. Given $n$ input strings, the closest string (substring) problem finds a new string within distance $d$ to (a substring of) each input string and such that $d$ ... Keywords: approximation algorithms, closest string, fixed-parameter algorithm, closest substring 14 October 2009 SIAM Journal on Computing: Volume 39 Issue 4, September 2009 Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 17 The closest string problem and the closest substring problem are all natural theoretical computer science problems and find important applications in computational biology. Given $n$ input strings, the closest string (substring) problem finds a new string within distance $d$ to (a substring of) each input string and such that $d$ ... Keywords: approximation algorithms, closest string, fixed-parameter algorithm, closest substring 15 September 2009 WI-IAT '09: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 Publisher: IEEE Computer Society Bibliometrics: Citation Count: 2 Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 100 Full text available: PDF On participatory Websites, users provide opinions about products, with both overall ratings and textual reviews. In this paper, we propose an approach to accurately estimate feature ratings of the products. This approach selects user reviews that extensively discuss specific features of the products (called specialized reviews), using information distance of ... Keywords: Data Mining, Text Mining, Kolmogorov Complexity, Information Distance 16 September 2009 Information Processing Letters: Volume 109 Issue 19, September, 2009 Publisher: Elsevier North-Holland, Inc. Bibliometrics: Citation Count: 1 The spaced seed is a filtration method to efficiently identify the regions of interest in string similarity searches. It is important to find the optimal spaced seed that achieves the highest search sensitivity. For some simple distributions of the similarities, the seed optimization problem was proved to be not NP-hard. ... Keywords: Computational complexity, Golomb ruler, Spaced seeds 17 September 2009 Bioinformatics: Volume 25 Issue 17, September 2009 Publisher: Oxford University Press Bibliometrics: Citation Count: 1 Motivation: The bottom-up tandem mass spectrometry (MS/MS) is regularly used in proteomics nowadays for identifying proteins from a sequence database. De novo sequencing software is also available for sequencing novel peptides with relatively short sequence lengths. However, automated sequencing of novel proteins from MS/MS remains a challenging problem. Results: Very ... 18 September 2009 IEEE Transactions on Audio, Speech, and Language Processing: Volume 17 Issue 7, September 2009 Bibliometrics: Citation Count: 0 This paper presents a strategy to optimize the phonotactic front-end for spoken language recognition. This is achieved by selecting a subset of phones from an existing phone recognizer's phone inventory such that only the phones that best discriminate each of the target languages are selected. Each such phone subset will ... Keywords: phonotactic feature, spoken language recognition, feature selection, target-oriented phone tokenizer (TOPT), parallel phone recognizer (PPR), universal phone recognizer 19 September 2009 IEEE Transactions on Audio, Speech, and Language Processing: Volume 17 Issue 7, September 2009 Publisher: IEEE Press Bibliometrics: Citation Count: 0 This paper presents a strategy to optimize the phonotactic front-end for spoken language recognition. This is achieved by selecting a subset of phones from an existing phone recognizer's phone inventory such that only the phones that best discriminate each of the target languages are selected. Each such phone subset will ... Keywords: phonotactic feature, spoken language recognition, target-oriented phone tokenizer (TOPT), Feature selection, parallel phone recognizer (PPR), universal phone recognizer 20 June 2009 ICME'09: Proceedings of the 2009 IEEE international conference on Multimedia and Expo Publisher: IEEE Press Bibliometrics: Citation Count: 1 We propose a speaker recognition system based on the acoustic segment modeling technique. It is assumed that the overall sound characteristics for speakers can be covered by a set of acoustic segment models (ASMs) while the ASMs are acoustically-motivated self-organized sound units without imposing any phonetic definitions. These acoustic segment ... Keywords: acoustic segment model, supervector

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.