|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 516 occurrences of 344 keywords
|
|
|
Results
Found 789 publication records. Showing 789 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
78 | Jianyong Wang 0001, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal |
CONTOUR: an efficient algorithm for discovering discriminating subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 18(1), pp. 1-29, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Discriminating subsequence, Summarization subsequence, Clustering, Sequence mining |
68 | Yoshiki Yamaguchi, Tsutomu Maruyama, Fumikazu Konishi, Akihiko Konagaya |
High speed tablation system using an FPGA designed for distribution tables of frequent DNA subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: FPL 2007, International Conference on Field Programmable Logic and Applications, Amsterdam, The Netherlands, 27-29 August 2007, pp. 145-150, 2007, IEEE, 1-4244-1060-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
55 | 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 |
53 | Ming-Der Shieh, Hsin-Fu Lo, Ming-Hwa Sheu |
High-speed generation of LFSR signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, pp. 222-, 2000, IEEE Computer Society, 0-7695-0887-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
high-speed generation, LFSR signatures, compaction simulation, single-input signature register, equivalent multiple-input implementation, finite field theory, high-speed signature computations, lookahead technique, internal-XOR LFSR, external-XOR LFSR, performance evaluation, logic testing, built-in self test, integrated circuit testing, automatic test pattern generation, BIST, linear feedback shift register, binary sequences, subsequences |
50 | 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 |
50 | Gerardo Perez, Yuridia P. Mejia, Iván Olmos, Jesus A. Gonzalez, Patricia Sánchez, Candelario Vázquez |
An Automaton for Motifs Recognition in DNA Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2009: Advances in Artificial Intelligence, 8th Mexican International Conference on Artificial Intelligence, Guanajuato, Mexico, November 9-13, 2009. Proceedings, pp. 556-565, 2009, Springer, 978-3-642-05257-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
50 | Xu Zhang, Tamer Kahveci |
QOMA2: Optimizing the alignment of many sequences. ![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. 780-787, 2007, IEEE Computer Society, 978-1-4244-1509-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Hugues Mercier, Majid Khabbazian, Vijay K. Bhargava |
On the Number of Subsequences When Deleting Symbols From a String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(7), pp. 3279-3285, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Akihiro Inokuchi, Takashi Washio |
A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 303-312, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Machiko Toyoda, Yasushi Sakurai, Toshikazu Ichikawa |
Identifying Similar Subsequences in Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 19th International Conference, DEXA 2008, Turin, Italy, September 1-5, 2008. Proceedings, pp. 210-224, 2008, Springer, 978-3-540-85653-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Bing Yang 0001, Jing Chen 0020, Enyue Lu, S. Q. Zheng 0001 |
A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 46-57, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algorithm, complexity, approximation, NP-complete, permutation, monotone, subsequence |
48 | Eamonn J. Keogh, Jessica Lin 0001 |
Clustering of time-series subsequences is meaningless: implications for previous and future research. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 8(2), pp. 154-177, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Data mining, Clustering, Time series, Rule discovery, Subsequence |
48 | Linhui Jiang |
A Quick Look at Methods for Mining Long Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003, Halifax, Canada, June 11-13, 2003, Proceedings, pp. 621-623, 2003, Springer, 3-540-40300-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Eitan Bachmat |
Average case analysis for batched disk scheduling and increasing subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 277-286, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
48 | Karl Entacher |
Bad Subsequences of Well-Known Linear Congruential Pseudo-Random Number Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 8(1), pp. 61-70, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
parallel pseudorandom number generator, random number generation, stochastic simulation, linear congruential generator, spectral test, lattice structure |
43 | Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White |
Reverse-Complement Similarity Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GTIT-C ![In: General Theory of Information Transfer and Combinatorics, pp. 814-830, 2006, Springer, 3-540-46244-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
code distance, rate of codes, insertion-deletion codes, similarity, codes, sequences, DNA sequences, subsequences |
43 | 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 |
40 | George S. Lueker |
Improved bounds on the average length of longest common subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(3), pp. 17:1-17:38, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences |
40 | Eitan Bachmat |
Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 49(3), pp. 212-231, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Increasing subsequences, Spacetime geometry, Patience sorting, Disk scheduling |
40 | 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 |
40 | Yujiun P. Wang, Theodosios Pavlidis |
Optimal Correspondence of String Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(11), pp. 1080-1087, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar |
40 | Lianzi Wen, Toshiyuki Amagasa, Hiroyuki Kitagawa |
An Approach for XML Similarity Join Using Tree Serialization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 13th International Conference, DASFAA 2008, New Delhi, India, March 19-21, 2008. Proceedings, pp. 562-570, 2008, Springer, 978-3-540-78567-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim |
A Practical Method for Approximate Subsequence Search in DNA Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007, Nanjing, China, May 22-25, 2007, Proceedings, pp. 921-931, 2007, Springer, 978-3-540-71700-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
DNA database, approximate subsequence search, suffix tree |
40 | Sven Rahmann |
Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 153-164, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Siamak Rezaei, Md. Maruf Monwar |
Divide-and-Conquer Algorithm for Clustalw-MPI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCECE ![In: Proceedings of the Canadian Conference on Electrical and Computer Engineering, CCECE 2006, May 7-10, 2006, Ottawa Congress Centre, Ottawa, Canada, pp. 717-720, 2006, IEEE, 1-4244-0038-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Tak-Chung Fu, Fu-Lai Chung, Robert W. P. Luk, Chak-man Ng |
Preventing Meaningless Stock Time Series Pattern Discovery by Changing Perceptually Important Point Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 1171-1174, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Shoji Hirano, Shusaku Tsumoto |
Multiscale Comparison of Temporal Patternsin Time-Series Medical Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Principles of Data Mining and Knowledge Discovery, 6th European Conference, PKDD 2002, Helsinki, Finland, August 19-23, 2002, Proceedings, pp. 188-199, 2002, Springer, 3-540-44037-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
multiscale matching, rough clustering, temporal knowledge discovery, rough sets, medical data mining |
38 | S. Vahid Jazayeri, Osmar R. Zaïane |
Plant Protein Localization Using Discriminative and Frequent Partition-Based Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 228-237, 2008, IEEE Computer Society, 978-0-7695-3503-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | 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 |
|
38 | Ho-Kwok Dai, Hung-Chi Su |
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 337-348, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Erdong Chen, Hao Yuan, Linji Yang |
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. ![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. 1153-1162, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Sang-Wook Kim, Jeehee Yoon, Sanghyun Park 0003, Tae-Hoon Kim 0001 |
Shape-based retrieval of similar subsequences in time-series databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), March 10-14, 2002, Madrid, Spain, pp. 438-445, 2002, ACM, 1-58113-445-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
shape-based retrieval, indexing, similarity search, time-series databases |
38 | Wolfgang Merkle |
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 390-400, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Sanghyun Park 0003, Wesley W. Chu, Jeehee Yoon, Chih-Cheng Hsu |
Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28 - March 3, 2000, pp. 23-32, 2000, IEEE Computer Society, 0-7695-0506-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Similarity Search, Suffix Tree, Time Warping, Sequence Database |
38 | Claus Rick |
Efficient Computation of All Longest Common Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 407-418, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Reuven Bar-Yehuda, Sergio Fogel |
Partitioning a Sequence into Few Monotone Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 35(5), pp. 421-440, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
35 | Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi |
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 86(3), pp. 735-756, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
35 | Andrzej Chmielowiec |
Algorithm for error-free determination of the variance of all contiguous subsequences and fixed-length contiguous subsequences for a sequence of industrial measurement data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Stat. ![In: Comput. Stat. 36(4), pp. 2813-2840, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
33 | Yoshinobu Higami, Yuzo Takamatsu, Kozo Kinoshita |
Test sequence compaction for sequential circuits with reset states. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, pp. 165-170, 2000, IEEE Computer Society, 0-7695-0887-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
reset states, test compaction method, single stuck-at fault assumption, unremovable vectors, fault-dropping fault simulation, nonfault-dropping fault simulation, reset signal, test subsequences, logic testing, fault detection, sequential circuits, sequential circuits, automatic test pattern generation, fault simulation, vectors, logic simulation, logic simulation, benchmark circuits, test vectors, signal detection, test sequence compaction |
33 | Hong Man, Faouzi Kossentini, Mark J. T. Smith |
A Class of EZW Image Coders for Noisy Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (3) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 90-93, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
EZW image coders, generalized image coding algorithm, embedded zerotree wavelet image coding, channel error resilience, channel error robustness, output bit sequence, source/channel coding algorithm, channel mismatching problem solution, bit stream, varying channel error conditions, fixed lenght codes, wavelet transforms, bit error rates, variable length codes, subsequences, noisy channels, compression performance |
33 | Mi Lu, Hua Lin |
Parallel Algorithms for the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(8), pp. 835-848, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound |
33 | Sylvia C. Boyd, Hasan Ural |
On the Complexity of Generating Optimal Test Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(9), pp. 976-978, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
maximal overlapping, test subsequences, optimal test sequence generation, OTSG problem, computational complexity, protocols, NP-complete, finite state machine, program testing, communications protocols, finite automata, polynomial time, FSM, protocol testing |
30 | Anne Denton, Christopher Besemann, Dietmar H. Dorr |
Pattern-based time-series subsequence clustering using radial distribution functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 18(1), pp. 1-27, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Time series subsequence clustering, Clustering noisy data, Time series labeling, Density-based clustering, Noise elimination |
30 | Lorenzo Favalli, Marco Folli |
ILPS: A Scalable Multiple Description Coding Scheme for H.264. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMN ![In: Future Multimedia Networking, Second International Workshop, FMN 2009, Coimbra, Portugal, June 22-23, 2009. Proceedings, pp. 14-25, 2009, Springer, 978-3-642-02471-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
inter layer prediction, scalability, Multiple Description Coding, H.264/SVC |
30 | Kang Deng, Osmar R. Zaïane |
Contrasting Sequence Groups by Emerging Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009, pp. 377-384, 2009, Springer, 978-3-642-04746-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Emerging Sequences, Sequence Similarity, Classification |
30 | K. R. Seeja, Mohd. Afshar Alam, S. K. Jain |
MotifMiner: A Table Driven Greedy Algorithm for DNA Motif Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence, 5th International Conference on Intelligent Computing, ICIC 2009, Ulsan, South Korea, September 16-19, 2009, Proceedings, pp. 397-406, 2009, Springer, 978-3-642-04019-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Regulatory motif, Greedy approach, Motif discovery, Information content |
30 | Bing Yang 0001, Jing Chen 0020, Enyue Lu, Si-Qing Zheng |
Design and Performance Evaluation of Sequence Partition Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(5), pp. 711-718, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
monotone subsequence, permutation algorithm, complexity, approximation, NP-complete |
30 | Mohammed Al-Shalalfa, Reda Alhajj |
Motif Location Prediction by Divide and Conquer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIRD ![In: Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings, pp. 102-113, 2008, Springer, 978-3-540-70598-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
conserved motifs, divide and conquer, gene expression data, sequence analysis, motif discovery |
30 | Yuan Lan, Yeng Chai Soh, Guang-Bin Huang |
Extreme Learning Machine based bacterial protein subcellular localization prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2008, part of the IEEE World Congress on Computational Intelligence, WCCI 2008, Hong Kong, China, June 1-6, 2008, pp. 1859-1863, 2008, IEEE, 978-1-4244-1820-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta |
An efficient data structure for applying multiple seeds in homology search. ![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. 1374-1378, 2007, IEEE Computer Society, 978-1-4244-1509-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Yu He, Xindong Wu 0001, Xingquan Zhu 0001, Abdullah N. Arslan |
Mining Frequent Patterns with Wildcards from Biological Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IRI ![In: Proceedings of the IEEE International Conference on Information Reuse and Integration, IRI 2007, 13-15 August 2007, Las Vegas, Nevada, USA, pp. 329-334, 2007, IEEE Systems, Man, and Cybernetics Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Fredrik Bengtsson, Jingsen Chen |
Efficient Algorithms for k Maximum Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(1), pp. 27-41, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Aiman H. El-Maleh, S. Saqib Khursheed, Sadiq M. Sait |
Efficient Static Compaction Techniques for Sequential Circuits Based on Reverse-Order Restoration and Test Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(11), pp. 2556-2564, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Carl Kingsford, Elena Zaslavsky, Mona Singh 0001 |
A Compact Mathematical Programming Formulation for DNA Motif Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 233-245, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann |
On Minimum k-Modal Partitions of Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 374-385, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
monotone sequence, k-modal sequence, cocoloring, approximation algorithm, online algorithm, Mixed integer program, hardness, LP rounding |
30 | Ming-Yen Lin, Suh-Yin Lee |
Efficient mining of sequential patterns with time constraints by delimited pattern growth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 7(4), pp. 499-514, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Pattern-growth, Data mining, Time constraint, Sequential patterns, Sequence mining |
30 | Aiman H. El-Maleh, S. Saqib Khursheed, Sadiq M. Sait |
Efficient Static Compaction Techniques for Sequential Circuits Based on Reverse Order Restoration and Test Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 14th Asian Test Symposium (ATS 2005), 18-21 December 2005, Calcutta, India, pp. 378-385, 2005, IEEE Computer Society, 0-7695-2481-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Jingyi Yang, Jitender S. Deogun, Zhaohui Sun |
A New Scheme for Protein Sequence Motif Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 38th Hawaii International Conference on System Sciences (HICSS-38 2005), CD-ROM / Abstracts Proceedings, 3-6 January 2005, Big Island, HI, USA, 2005, IEEE Computer Society, 0-7695-2268-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Zheng Liu 0001, Jeffrey Xu Yu, Xuemin Lin 0001, Hongjun Lu, Wei Wang 0011 |
Locating Motifs in Time-Series Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings, pp. 343-353, 2005, Springer, 3-540-26076-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Fredrik Bengtsson, Jingsen Chen |
Efficient Algorithms for k Maximum Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 137-148, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Abdullah N. Arslan, Ömer Egecioglu |
Algorithms for Local Alignment with Length Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 38-51, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Nico Jacobs, Hendrik Blockeel |
The Learning Shell: Automated Macro Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
User Modeling ![In: User Modeling 2001, 8th International Conference, UM 2001, Sonthofen, Germany, July 13-17, 2001, Proceedings, pp. 34-43, 2001, Springer, 3-540-42325-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
interface adaptation, machine learning, inductive logic programming |
30 | 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 |
|
30 | Haixun Wang, Chang-Shing Perng |
The S2-Tree : An Index Structure for Subsequence Matching of Spatial Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Knowledge Discovery and Data Mining - PAKDD 2001, 5th Pacific-Asia Conference, Hong Kong, China, April 16-18, 2001, Proceedings, pp. 312-323, 2001, Springer, 3-540-41910-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Irith Pomeranz, Sudhakar M. Reddy |
Static Test Compaction for Scan-Based Designs to Reduce Test Application Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 16(5), pp. 541-552, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
scan circuits, test application time, static test compaction |
30 | Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Hong Lee, Chin-Wan Chung |
Similarity Search for Multidimensional Data Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28 - March 3, 2000, pp. 599-608, 2000, IEEE Computer Society, 0-7695-0506-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multidimensional data sequence, subsequence finding, similarity search, multimedia retrieval, video search |
30 | Karl Entacher |
Parallel Streams of Linear Random Numbers in the Spectral Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 9(1), pp. 31-44, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
leap-frog technique, long-range correlations, parallel random numbers, random number generation, stochastic simulation, linear congruential generator, spectral test, lattice structure |
30 | Irith Pomeranz, Sudhakar M. Reddy |
Static Test Compaction for Scan-Based Designs to Reduce Test Application Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 7th Asian Test Symposium (ATS '98), 2-4 December 1998, Singapore, pp. 198-203, 1998, IEEE Computer Society, 0-8186-8277-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | |
Frequent Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Database Systems ![In: Encyclopedia of Database Systems, pp. 1190, 2009, Springer US, 978-0-387-35544-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | 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 |
|
28 | Yves Edel |
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G ). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 47(1-3), pp. 125-134, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
AMS Classifications 11B50, 20K01, 51E22 |
28 | 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 |
|
28 | Bryant A. Julstrom, Brenda Hinkemeyer |
Starting from Scratch: Growing Longest Common Subsequences with Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Procedings, pp. 930-938, 2006, Springer, 3-540-38990-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
initially empty solutions, genetic algorithm, Longest common subsequence |
28 | Alexandre Tiskin |
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 270-281, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | 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 |
|
28 | 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 |
|
28 | Philip Bille, Inge Li Gørtz |
Matching Subsequences in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 248-259, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Abdullah N. Arslan, Ömer Egecioglu |
Efficient Computation of Long Similar Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings, pp. 77-90, 2002, Springer, 3-540-44158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
normalized local alignment, ratio maximization, approximation algorithm, dynamic programming, Local alignment |
28 | Ricardo A. Baeza-Yates, Ricard Gavaldà, Gonzalo Navarro 0001, Rodrigo Scheihing |
Bounding the Expected Length of Longest Common Subsequences and Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 32(4), pp. 435-452, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Patricia A. Evans |
Finding Common Subsequences with Arcs and Pseudoknots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings, pp. 270-280, 1999, Springer, 3-540-66278-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Daniel S. Hirschberg |
Bounds on the Number of String Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings, pp. 115-122, 1999, Springer, 3-540-66278-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Tao Jiang 0001, Ming Li 0001 |
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 191-202, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
23 | Ed Huai-hsin Chi, Peter Pirolli, James E. Pitkow |
The scent of a site: a system for analyzing and predicting information scent, usage, and usability of a Web site. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the CHI 2000 Conference on Human factors in computing systems, The Hague, The Netherlands, April 1-6, 2000., pp. 161-168, 2000, ACM, 1-58113-216-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
dome tree, longest repeated subsequences, usage-based layout, data mining, World Wide Web, usability, information visualization, information foraging, information scent |
23 | Wen-Chen Hu, Mark S. Schmalz, Gerhard X. Ritter |
COQUINA: Content-Queryable Image and Signal Archives. ![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. 1009-1010, 1999, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Longest approximate common subsequences, Line strings, Image databases |
23 | Walter F. Tichy |
The String-to-String Correction Problem with Block Moves ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 2(4), pp. 309-321, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
block moves, revision control, source control, string deltas, pattern matching, longest common subsequences, string edits |
20 | Feng Zhang 0011, Ran Tao 0003, Yue Wang 0001 |
Oversampling analysis in fractional Fourier domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 52(8), pp. 1446-1455, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
chirp signal, fractional Fourier transform, oversampling |
20 | Minghui Jiang 0001 |
Inapproximability of Maximal Strip Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 616-625, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Yueguo Chen, Gang Chen 0001, Ke Chen 0005, Beng Chin Ooi |
Efficient Processing of Warping Time Series Join of Motion Capture Data. ![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. 1048-1059, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Lusheng Wang 0001, Binhai Zhu |
On the Tractability of Maximal Strip Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 400-409, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan Cheng 0004, Ke Xu 0001 |
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 5th International Conference, ADMA 2009, Beijing, China, August 17-19, 2009. Proceedings, pp. 652-660, 2009, Springer, 978-3-642-03347-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
repetitive gapped sequential pattern, compressing frequent patterns |
20 | Pratibha Rani, Vikram Pudi |
RBNBC: Repeat Based Naive Bayes Classifier for Biological Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 989-994, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Peng Zou, Liang Su, Yan Jia 0001, Weihong Han, Shuqiang Yang |
Fast similarity matching on data stream with noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE Workshops ![In: Proceedings of the 24th International Conference on Data Engineering Workshops, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pp. 194-199, 2008, IEEE Computer Society, 978-1-4244-2161-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Søren Riis |
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 272-283, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Algebraic proof complexity, predicate logic, Propositional proof complexity |
20 | 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 |
|
20 | Necmiye Ozay, Mario Sznaier, Octavia I. Camps |
Sequential sparsification for change detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA, 2008, IEEE Computer Society, 978-1-4244-2242-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Ji Tao, Yap-Peng Tan |
Face clustering in videos using constraint propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS ![In: International Symposium on Circuits and Systems (ISCAS 2008), 18-21 May 2008, Sheraton Seattle Hotel, Seattle, Washington, USA, pp. 3246-3249, 2008, IEEE, 978-1-4244-1683-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Zhixiang Chen 0001, Bin Fu, Minghui Jiang 0001, Binhai Zhu |
On Recovering Syntenic Blocks from Comparative Maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 319-327, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Eamonn J. Keogh, Jessica Lin 0001, Sang-Hee Lee, Helga Van Herle |
Finding the most unusual time series subsequence: algorithms and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 11(1), pp. 1-27, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Time series data mining, Clustering, Anomaly detection |
20 | Raffay Hamid, Siddhartha Maddi, Aaron F. Bobick, Irfan A. Essa |
Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 789 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ >>] |
|