Sciweavers

253 search results - page 34 / 51
» The Sketching Complexity of Pattern Matching
Sort
View
ICA
2012
Springer
12 years 3 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 8 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
RECOMB
2004
Springer
14 years 7 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
ICPR
2000
IEEE
14 years 8 months ago
A Model of Stroke Extraction from Chinese Character Images
Given the large number and complexity of Chinese characters, pattern matching based on structural decomposition and analysis is believed to be necessary and essential to off-line ...
Ruini Cao, Chew Lim Tan