|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 488 occurrences of 321 keywords
|
|
|
Results
Found 1232 publication records. Showing 1232 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
34 | Zdenek Tronícek |
Common Subsequence Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers, pp. 270-275, 2002, Springer, 3-540-40391-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | B. John Oommen, R. K. S. Loke |
On the Pattern Recognition of Noisy Subsequence Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 23(9), pp. 929-946, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Yang-Sae Moon, Kyu-Young Whang, Woong-Kee Loh |
Duality-Based Subsequence Matching in Time-Series Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, Germany, pp. 263-272, 2001, IEEE Computer Society, 0-7695-1001-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Brenda S. Baker, Raffaele Giancarlo |
Longest Common Subsequence from Fragments via Sparse Dynamic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 79-90, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Wilfred J. Hansen |
Subsequence References: First-Class Values for Substrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 14(4), pp. 471-489, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
ATK, AUIS, Andrew Toolkit, Ness, sequences, strings, document processing, programming language design, subsequences, string searching, substrings |
34 | Koji Hakata, Hiroshi Imai |
The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 469-478, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
34 | Hua Lin, Mi Lu, Jesse Zhixi Fang |
An optimal algorithm for the longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 630-639, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
34 | Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman |
Bounds on the Complexity of the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 23(1), pp. 1-12, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
33 | Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song |
Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 7th International Conference, ICA3PP 2007, Hangzhou, China, June 11-14, 2007, Proceedings, pp. 60-71, 2007, Springer, 978-3-540-72904-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
row-sorted 1-variant matrices, all-substring longest common subsequence, parallel algorithms, data structure, longest common subsequence |
33 | Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. Patel |
Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 15th IEEE VLSI Test Symposium (VTS'97), April 27-May 1, 1997, Monterey, California, USA, pp. 188-195, 1997, IEEE Computer Society, 0-8186-7810-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
inert subsequence, recurrence subsequence, test set compaction |
31 | Wei Liu, Lin Chen |
A Fast Longest Common Subsequence Algorithm for Biosequences Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCTA ![In: Computer And Computing Technologies In Agriculture, Volume I, First IFIP TC 12 International Conference on Computer and Computing Technologies in Agriculture (CCTA 2007), Wuyishan, China, August 18-20, 2007, pp. 61-69, 2007, Springer, 978-0-387-77250-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
identical character pair, bioinformatics, longest common subsequence |
30 | Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu |
The Longest Subsequence-Repeated Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.06862, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
30 | Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu |
The Longest Subsequence-Repeated Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA (1) ![In: Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I, pp. 446-458, 2023, Springer, 978-3-031-49610-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
30 | Alireza Abdi, Mohsen Hooshmand |
Longest Common Subsequence: Tabular vs. Closed-Form Equation Computation of Subsequence Probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.11726, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Elizabeth J. Itskovich, Vadim E. Levit |
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(11), pp. 237, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
30 | Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen |
Palindromic Subsequence Automata and Longest Common Palindromic Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 11(2), pp. 219-232, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
30 | Xiaodong Wang 0003, Daxin Zhu |
Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SmartCom ![In: Smart Computing and Communication - First International Conference, SmartCom 2016, Shenzhen, China, December 17-19, 2016, Proceedings, pp. 419-428, 2016, Springer, 978-3-319-52014-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
29 | Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song |
A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, pp. 831-840, 2006, Springer, 3-540-37783-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Longin Jan Latecki, Vasileios Megalooikonomou, Qiang Wang 0010, Rolf Lakämper, Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh |
Partial Elastic Matching of Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 701-704, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Haixun Wang, Xiaofeng Meng 0001 |
On the Sequencing of Tree Structures for XML Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5-8 April 2005, Tokyo, Japan, pp. 372-383, 2005, IEEE Computer Society, 0-7695-2285-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Jiong Yang 0001, Wei Wang 0010, Philip S. Yu |
Mining Asynchronous Periodic Patterns in Time Series Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(3), pp. 613-628, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Asynchronous periodic pattern, segment-based approach, partial periodicity |
29 | Amihood Amir, Kenneth Ward Church, Emanuel Dar |
Separable attributes: a technique for solving the sub matrices character count problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 400-401, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
29 | Tiecheng Liu, John R. Kender |
Optimization Algorithms for the Selection of Key Frame Sequences of Variable Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (4) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part IV, pp. 403-417, 2002, Springer, 3-540-43748-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Dimitrios Gunopulos, Gautam Das 0001 |
Time Series Similarity Measures and Time Series Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, Santa Barbara, CA, USA, May 21-24, 2001, pp. 624, 2001, ACM, 1-58113-332-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Wen-Chen Hu, Mark S. Schmalz, Gerhard X. Ritter |
Image Retrieval Using the Longest Approximate Common Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMCS, Vol. 2 ![In: IEEE International Conference on Multimedia Computing and Systems, ICMCS 1999, Florence, Italy, June 7-11, 1999. Volume II, pp. 730-734, 1999, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Longest approximate common subsequences, Line string, Image databases |
29 | Edward K. Blum, Philip C. Curtis Jr. |
Asymptotic Behavior of the Best Polynomial Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 8(4), pp. 645-647, 1961. The full citation details ...](Pics/full.jpeg) |
1961 |
DBLP DOI BibTeX RDF |
|
26 | Vinod P. Nair, Vijay Laxmi, Manoj Singh Gaur, G. V. S. S. Phani Kumar, Yadvendra S. Chundawat |
Static CFG analyzer for metamorphic Malware code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIN ![In: Proceedings of the 2nd International Conference on Security of Information and Networks, SIN 2009, Gazimagusa, North Cyprus, October 6-10, 2009, pp. 225-228, 2009, ACM, 978-1-60558-412-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
metamorphic malware, normalization, obfuscation, control flow graph, longest common subsequence |
26 | Ping Luo 0001, Jian Fan, Sam Liu, Fen Lin, Yuhong Xiong, Jerry Liu |
Web article extraction for web printing: a DOM+visual based approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Symposium on Document Engineering ![In: Proceedings of the 2009 ACM Symposium on Document Engineering, Munich, Germany, September 16-18, 2009, pp. 66-69, 2009, ACM, 978-1-60558-575-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
article extraction, maximal scoring subsequence |
26 | Lian'en Huang, Lei Wang, Xiaoming Li |
Achieving both high precision and high recall in near-duplicate detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 63-72, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
web document repository, similarity, sketch, fingerprint, longest common subsequence, near-duplicate |
26 | Bingjun Sun, Prasenjit Mitra, C. Lee Giles |
Mining, indexing, and searching for textual chemical molecule information on the web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 735-744, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hierarchical text segmentation, independent frequent subsequence, index pruning, substring search, ranking, similarity search, conditional random fields, entity extraction |
26 | Francisco Nivando Bezerra, Neucimar Jerônimo Leite |
Using string matching to detect video transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 10(1), pp. 45-54, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Video transition detection, Video slice, Longest common subsequence |
26 | Iman S. H. Suyoto, Alexandra L. Uitdenbogerd, Falk Scholer |
Effective retrieval of polyphonic audio with polyphonic symbolic queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multimedia Information Retrieval ![In: Proceedings of the 9th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2007, Augsburg, Bavaria, Germany, September 24-29, 2007, pp. 105-114, 2007, ACM, 978-1-59593-778-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
polyphony, dynamic programming, audio, music information retrieval, longest common subsequence, symbolic, transcription |
26 | Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, Eamonn J. Keogh |
Indexing Multidimensional Time-Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 15(1), pp. 1-20, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Ensemble index, Motion capture, Trajectories, Dynamic time warping, Longest common subsequence |
26 | Hsiao Ping Lee, Yin-Te Tsai, Chuan Yi Tang |
A seriate coverage filtration approach for homology search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, pp. 180-184, 2004, ACM, 1-58113-812-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
incrementally decreasing covers, longest increasing subsequence problems, lossless filtration, seriate coverage, homology search |
26 | Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, Eamonn J. Keogh |
Indexing multi-dimensional time-series with support for multiple distance measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003, pp. 216-225, 2003, ACM, 1-58113-737-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
trajectories, dynamic time warping, longest common subsequence |
26 | Francisco Nivando Bezerra, Neucimar Jerônimo Leite |
Video Transition Detection Using String Matching: Preliminary Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003), 12-15 October 2003, Sao Carlos, Brazil, pp. 339-346, 2003, IEEE Computer Society, 0-7695-2032-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
video transition detection, visual rhythm, longest common subsequence, video parsing |
26 | Xiaoping Tang, D. F. Wong 0001 |
Floorplanning with alignment and performance constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 39th Design Automation Conference, DAC 2002, New Orleans, LA, USA, June 10-14, 2002, pp. 848-853, 2002, ACM, 1-58113-461-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
floorplanning, longest common subsequence, sequence pair |
26 | Alan A. Bertossi, Alessandro Mei |
Constant Time Dynamic Programming on Directed Reconfigurable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(6), pp. 529-536, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
directed links, VLSI, dynamic programming, shortest paths, Reconfigurable architectures, longest common subsequence |
26 | Zdenek Tronícek |
Problems Related to Subsequences and Supersequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE/CRIWG ![In: Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999, pp. 199-205, 1999, IEEE Computer Society, 0-7695-0268-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
supersequence, Directed Acyclic Supersequence Graph, seaching subsequences, subsequence |
26 | Minoru Asogawa, Yukiko Fujiwara, Akihiko Konagaya |
A combination of a functional motif model and a structural motif model for a database validation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (5) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 174-183, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
functional motif model, structural motif model, database validation, leucine zipper motif, twisted alpha helix sequences, DNA binding site, alpha helix region, Swiss Protein database, helical structures, PDB database, neural network, hidden Markov models, HMM, hidden Markov model, database management systems, neural nets, DNA, genetics, biology computing, subsequence |
25 | Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Seung-won Hwang, Hwanjo Yu |
A new approach for processing ranked subsequence matching based on ranked union. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011, pp. 457-468, 2011, ACM, 978-1-4503-0661-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Matthew K. Franklin, Mark A. Gondree, Payman Mohassel |
Communication-Efficient Private Protocols for Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2009, The Cryptographers' Track at the RSA Conference 2009, San Francisco, CA, USA, April 20-24, 2009. Proceedings, pp. 265-278, 2009, Springer, 978-3-642-00861-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
On the Longest Common Parameterized Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings, pp. 303-315, 2008, Springer, 978-3-540-69066-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Dmitry Korkin, Qingguo Wang, Yi Shang |
An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2008 International Conference on Parallel Processing, ICPP 2008, September 8-12, 2008, Portland, Oregon, USA, pp. 354-363, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Alexander K. Seewald, Florian Kleedorfer |
Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Data Anal. Classif. ![In: Adv. Data Anal. Classif. 1(3), pp. 221-239, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68T05, 93A30, 90C59 |
25 | Christian Blum 0001, Maria J. Blesa |
Probabilistic Beam Search for the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SLS ![In: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings, pp. 150-161, 2007, Springer, 978-3-540-74445-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Longin Jan Latecki, Qiang Wang 0010, Suzan Köknar-Tezel, Vasileios Megalooikonomou |
Optimal Subsequence Bijection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 565-570, 2007, IEEE Computer Society, 0-7695-3018-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton |
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2007, October 14-17, 2007, Harvard Medical School, Boston, MA, USA, pp. 327-333, 2007, IEEE Computer Society, 978-1-4244-1509-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Anna Gál, Parikshit Gopalan |
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 294-304, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Dariusz Król 0001, Grzegorz Stanislaw Kukla |
Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES-AMSTA ![In: Agent and Multi-Agent Systems: Technologies and Applications, First KES International Symposium, KES-AMSTA 2007, Wroclaw, Poland, May 31- June 1, 2007, Proceedings, pp. 694-703, 2007, Springer, 978-3-540-72829-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | M. Sohel Rahman, Costas S. Iliopoulos |
Algorithms for Computing Variants of the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 399-408, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Tsuyoshi Idé |
Why Does Subsequence Time-Series Clustering Produce Sine Waves? ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings, pp. 211-222, 2006, Springer, 3-540-45374-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Tsuyoshi Idé |
Translational Symmetry in Subsequence Time-Series Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JSAI ![In: New Frontiers in Artificial Intelligence, JSAI 2006 Conference and Workshops, Tokyo, Japan, June 5-9 2006, Revised Selected Papers, pp. 5-18, 2006, Springer, 3-540-69901-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Peter Krusche, Alexandre Tiskin |
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (5) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V, pp. 165-174, 2006, Springer, 3-540-34079-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Osmar R. Zaïane, Yang Wang, Randy Goebel, Gregory J. Taylor |
Frequent Subsequence-Based Protein Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BioDM ![In: Data Mining for Biomedical Applications, PAKDD 2006 Workshop, BioDM 2006, Singapore, April 9, 2006, Proceedings, pp. 35-47, 2006, Springer, 3-540-33104-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Xiuzhen Huang |
Lower Bounds and Parameterized Approach for Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 136-145, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Wun-Tat Chan, Yong Zhang 0001, Stanley P. Y. Fung, Deshi Ye, Hong Zhu 0004 |
Efficient Algorithms for Finding a Longest Common Increasing Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 665-674, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Xiao-hua Xu, Ling Chen 0005, Yi Pan 0001, Ping He 0001 |
Fast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part III, pp. 338-348, 2005, Springer, 3-540-25862-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Lasse Bergroth |
Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings, pp. 301-314, 2005, Springer, 3-540-29740-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Jian-Wei Liu, Shou-Jian Yu, Jia-Jin Le |
The Dimension-Reduced Multi-scale Histogram: A New Method for Fast and Efficient Retrieval of Similar Time Sequences and Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: Advances in Web-Age Information Management: 5th International Conference, WAIM 2004, Dalian, China, July 15-17, 2004, pp. 45-54, 2004, Springer, 3-540-22418-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Adrian Kosowski |
An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings, pp. 93-100, 2004, Springer, 3-540-23210-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Marcos A. Kiwi, Martin Loebl, Jirí Matousek 0001 |
Expected Length of the Longest Common Subsequence for Large Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 302-311, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Thierry Garcia, Jean Frédéric Myoupo, David Semé |
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 11th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP 2003), 5-7 February 2003, Genova, Italy, pp. 349-356, 2003, IEEE Computer Society, 0-7695-1875-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Teddy Siu Fung Wong, Man Hon Wong 0001 |
Efficient Subsequence Matching for Sequences Databases under Time Warping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: 7th International Database Engineering and Applications Symposium (IDEAS 2003), 16-18 July 2003, Hong Kong, China, pp. 139-148, 2003, IEEE Computer Society, 0-7695-1981-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Lasse Bergroth, Harri Hakonen, Juri Väisänen |
New Refinement Techniques for Longest Common Subsequence Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings, pp. 287-303, 2003, Springer, 3-540-20177-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Xiaoping Tang, Ruiqi Tian, Martin D. F. Wong |
Fast evaluation of sequence pair in block placement by longestcommon subsequence computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(12), pp. 1406-1413, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang 0001, Jianjun Wen |
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 444-455, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Xiaoping Tang, D. F. Wong 0001, Ruiqi Tian |
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2000 Design, Automation and Test in Europe (DATE 2000), 27-30 March 2000, Paris, France, pp. 106-111, 2000, IEEE Computer Society / ACM, 0-7695-0537-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Vlado Dancík, Mike Paterson |
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 669-678, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Classification computational complexity, stringmatching, average-case analysis |
19 | Peter Krusche, Alexander Tiskin |
New algorithms for efficient parallel string comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 209-216, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
BSP algorithms, longest increasing subsequences, longest common subsequences |
19 | D. T. Lee, Tien-Ching Lin, Hsueh-I Lu |
Fast Algorithms for the Density Finding Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 298-313, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Maximum-density segment problem, Density finding problem, Slope selection problem, GC content, Computational geometry, Bioinformatics, Convex hull, DNA sequence |
19 | Bolin Ding, David Lo 0001, Jiawei Han 0001, Siau-Cheng Khoo |
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 1024-1035, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Niall J. Haslam, Toby J. Gibson |
EpiC: A Resource for Integrating Information and Analyses to Enable Selection of Epitopes for Antibody Based Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DILS ![In: Data Integration in the Life Sciences, 6th International Workshop, DILS 2009, Manchester, UK, July 20-22, 2009. Proceedings, pp. 173-181, 2009, Springer, 978-3-642-02878-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Amihood Amir, Zvi Gotthilf, B. Riva Shalom |
Weighted LCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 36-47, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Congnan Luo, Soon M. Chung |
A scalable algorithm for mining maximal frequent sequences using a sample. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 15(2), pp. 149-179, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximal frequent sequences, Data mining, Performance analysis, Sampling, Signatures, Prefix tree |
19 | Jan Stola |
Unimaximal Sequences of Pairs in Rectangle Visibility Drawing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 61-66, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Francisco Claude, Gonzalo Navarro 0001, Hannu Peltola, Leena Salmela, Jorma Tarhio |
Speeding Up Pattern Matching by Text Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings, pp. 87-98, 2008, Springer, 978-3-540-89096-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi |
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 329-338, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yueguo Chen, Mario A. Nascimento, Beng Chin Ooi, Anthony K. H. Tung |
SpADe: On Shape-based Pattern Detection in Streaming Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 786-795, 2007, IEEE Computer Society, 1-4244-0802-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Sijung Kim, Geuk Lee, Bonghan Kim |
The Design and Testing of Automated Signature Generation Engine for Worms Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES-AMSTA ![In: Agent and Multi-Agent Systems: Technologies and Applications, First KES International Symposium, KES-AMSTA 2007, Wroclaw, Poland, May 31- June 1, 2007, Proceedings, pp. 956-963, 2007, Springer, 978-3-540-72829-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette |
Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BSB ![In: Advances in Bioinformatics and Computational Biology, Second Brazilian Symposium on Bioinformatics, BSB 2007, Angra dos Reis, Brazil, August 29-31, 2007, Proceedings, pp. 101-112, 2007, Springer, 978-3-540-73730-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
arc-annotated sequences, motif extraction, RNA structures |
19 | Hui Wang 0001, Zhiwei Lin 0002 |
A Novel Algorithm for Counting All Common Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GrC ![In: 2007 IEEE International Conference on Granular Computing, GrC 2007, San Jose, California, USA, 2-4 November 2007, pp. 502-, 2007, IEEE Computer Society, 0-7695-3032-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Jens Gramm, Jiong Guo, Rolf Niedermeier |
Pattern matching for arc-annotated sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(1), pp. 44-65, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Arc-annotated sequences, dynamic programming, pattern matching, RNA secondary structure |
19 | David J. Grynkiewicz |
A Weighted Erdös-Ginzburg-Ziv Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(4), pp. 445-453, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 11B75, 05D99 |
19 | Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée |
Hidden word statistics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(1), pp. 147-183, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
De Bruijn graph, combinatorial calculus, complex asymptotics, discrete probability, distributional analysis, Pattern matching, languages, generating functions, words, subsequences |
19 | Wolfgang Merkle, Jan Reimann 0001 |
Selection Functions that Do Not Preserve Normality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(5), pp. 685-697, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Eamonn J. Keogh, Jessica Lin 0001, Ada Wai-Chee Fu, Helga Van Herle |
Finding Unusual Medical Time-Series Subsequences: Algorithms and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Technol. Biomed. ![In: IEEE Trans. Inf. Technol. Biomed. 10(3), pp. 429-439, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | David Liben-Nowell, Erik Vee, An Zhu |
Finding longest increasing and common subsequences in streaming data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(2), pp. 155-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Data-streaming model, Algorithms, Lower bounds, LCS, LIS |
19 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
Cache-oblivious dynamic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 591-600, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz |
Faster Algorithms for Computing Longest Common Increasing Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 330-341, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Sun Wu, Hsien-Tsung Chang, Ting-Chao Hsu, Pei-Shin Liu |
Approximate Keyword Search in Web Search Engines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDIM ![In: First IEEE International Conference on Digital Information Management (ICDIM), December 6-8, 2006, Christ College, Bangalore, India, Proceedings, pp. 404-411, 2006, IEEE, 1-4244-0682-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Longin Jan Latecki, Vasilis Megalooikonomou, Qiang Wang 0010, Rolf Lakämper, Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh |
Elastic Partial Matching of Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings, pp. 577-584, 2005, Springer, 3-540-29244-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima |
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 186-193, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Ruben G. Lobo, Donald L. Bitzer, Mladen A. Vouk |
Locally Invertible Multivariate Polynomial Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCC ![In: Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers, pp. 427-441, 2005, Springer, 978-3-540-35481-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Grzegorz Kondrak |
N-Gram Similarity and Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings, pp. 115-126, 2005, Springer, 3-540-29740-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | I-Hsien Ting, Chris Kimble, Daniel Kudenko |
UBB Mining: Finding Unexpected Browsing Behaviour in Clickstream Data to Improve a Web Site's Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Web Intelligence ![In: 2005 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2005), 19-22 September 2005, Compiegne, France, pp. 179-185, 2005, IEEE Computer Society, 0-7695-2415-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | David Liben-Nowell, Erik Vee, An Zhu |
Finding Longest Increasing and Common Subsequences in Streaming Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 263-272, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Jeremy Z. Kolter, Marcus A. Maloof |
Using additive expert ensembles to cope with concept drift. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Second International Conference (ICML 2005), Bonn, Germany, August 7-11, 2005, pp. 449-456, 2005, ACM, 1-59593-180-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Sen Jia, Yuntao Qian, Guang Dai |
An Advanced Segmental Semi-Markov Model Based Online Series Pattern Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (3) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 634-637, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
online pattern detection, series data mining, segmental semi-Markov model |
19 | Chia-Hsiung Lee, Chung-Wen Cho, Yi-Hung Wu, Arbee L. P. Chen |
A Novel Representation of Sequence Data Based on Structural Information for Effective Music Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advances Applications, 9th International Conference, DASFAA 2004, Jeju Island, Korea, March 17-19, 2004, Proceedings, pp. 393-404, 2004, Springer, 3-540-21047-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Markov-model, Sequential pattern, Music retrieval, Music representation |
Displaying result #101 - #200 of 1232 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|