146 search results - page 9 / 30 » Efficient manipulation of binary data using pattern matching |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
DEXAW
2006
IEEE
14 years 1 months ago
2006
IEEE
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
IVS
2008
13 years 7 months ago
2008
This article presents a study that investigates the ability of humans to perceive relationships (patterns) in parallel coordinates, an ability that is crucial to the use of this p...