Sciweavers

617 search results - page 10 / 124
» Patterns for decoupling data structures and algorithms
Sort
View
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
14 years 12 days ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
ACCV
2010
Springer
13 years 2 months ago
A Weak Structure Model for Regular Pattern Recognition Applied to Facade Images
Abstract. We propose a novel method for recognition of structured images and demonstrate it on detection of windows in facade images. Given an ability to obtain local low-level dat...
Radim Tylecek, Radim Sára
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
13 years 12 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
DATESO
2009
146views Database» more  DATESO 2009»
13 years 5 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas