Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Kuan-Yu Chen"'
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9783642273223
A new 2.6 GHz CMOS front-end for LTE 4G handset receiver is proposed. LTE 4G handset receiver front-end using a dual gain mode folded-cascode (DGMFC) scheme provides a 15.3 dB/24.8 dB forward gain, noise figure of 4.5 dB/4.0 dB, and an IIP3 at -13.8
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0eccfee885a4459f4f5fe84324c861d
https://doi.org/10.1007/978-3-642-27323-0_91
https://doi.org/10.1007/978-3-642-27323-0_91
Autor:
Hung-Lung Wang, Kuan-Yu Chen
Publikováno v:
String Processing and Information Retrieval ISBN: 9783642245824
SPIRE
SPIRE
Given two sets of points, the text and the pattern, determining whether the pattern "appears" in the text is modeled as the point set pattern matching problem. Applications usually ask for not only exact matches between these two sets, but also appro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ae0ba096c101515ce5174397cc44d1c
https://doi.org/10.1007/978-3-642-24583-1_9
https://doi.org/10.1007/978-3-642-24583-1_9
Autor:
Sheue-Ling Hwang, Pei-Chia Wang, Jinn-Cherng Yang, Kuan-Yu Chen, Jinn-Sen Chen, Hung-Lu Chang
Publikováno v:
Communications in Computer and Information Science ISBN: 9783642220944
HCI (23)
HCI (23)
In this paper, we investigated that display luminance and ambient illumination had significant effects on the perception of the imagery displayed, and their appropriate combination would be studied. The results showed display luminance and ambient il
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b1309576d40d55b239e85c6bde60c68
https://doi.org/10.1007/978-3-642-22095-1_75
https://doi.org/10.1007/978-3-642-22095-1_75
Publikováno v:
Algorithms and Computation ISBN: 9783642175138
ISAAC (2)
ISAAC (2)
We study the problem of identifying palindromes in compressed strings. The underlying compression scheme is called run-length encoding, which has been extensively studied and widely applied in diverse areas. Given a run-length encoded string \(\texts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::996a574cc4253fd6506e20dbd8b9c4bf
https://doi.org/10.1007/978-3-642-17514-5_29
https://doi.org/10.1007/978-3-642-17514-5_29
Autor:
Kuan-Yu Chen, Kun-Mao Chao
Publikováno v:
Algorithms – ESA 2010 ISBN: 9783642157745
ESA (1)
ESA (1)
In this paper, a commonly used data compression scheme, called run-length encoding, is employed to speed up the computation of edit distance between two strings. Our algorithm is the first to achieve "fully compressed," meaning that it runs in time p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::144118593039658681dabb50b01f95e1
https://doi.org/10.1007/978-3-642-15775-2_36
https://doi.org/10.1007/978-3-642-15775-2_36
Publikováno v:
Combinatorial Pattern Matching ISBN: 9783642024405
CPM
CPM
In this paper, we consider a commonly used compression scheme called run-length encoding (abbreviated rle ). We provide lower bounds for problems of approximately matching two rle strings. Specifically, we show that the wildcard matching and k -misma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09e5b897842c21ffcaf1326cccfeef6c
https://doi.org/10.1007/978-3-642-02441-2_15
https://doi.org/10.1007/978-3-642-02441-2_15
Publikováno v:
Algorithms and Computation ISBN: 9783642106309
ISAAC
ISAAC
We study the problem of finding all maximal approximate gapped palindromes in a string. More specifically, given a string S of length n, a parameter q ? 0 and a threshold k > 0, the problem is to identify all substrings in S of the form uvw such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fb7d2ef02af6c642b5910b75efb09e8
https://doi.org/10.1007/978-3-642-10631-6_109
https://doi.org/10.1007/978-3-642-10631-6_109
Publikováno v:
Algorithms and Computation ISBN: 9783540309352
ISAAC
ISAAC
Given a sequence of n real numbers and an integer k, $1 \leq k \leq {1 \over 2}n(n - 1)$, the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all possible segment sums. Recently, Bengtsson and Chen gave a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0f801fd12e6080a517ea7e4eb874d7e
https://doi.org/10.1007/11602613_80
https://doi.org/10.1007/11602613_80
Autor:
Kun-Mao Chao, Kuan-Yu Chen
Publikováno v:
Algorithms and Computation ISBN: 9783540241317
ISAAC
ISAAC
We are given a sequence A of n real numbers which is to be preprocessed In the Range Maximum-Sum Segment Query (RMSQ) problem, a query is comprised of two intervals [i,j] and [k,l] and our goal is to return the maximum-sum segment of A whose starting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9ba818960b94344141c91bda7a883d3
https://doi.org/10.1007/978-3-540-30551-4_27
https://doi.org/10.1007/978-3-540-30551-4_27