Sciweavers

11394 search results - page 384 / 2279
» Error-Correcting Data Structures
Sort
View
BTW
2003
Springer
140views Database» more  BTW 2003»
15 years 10 months ago
An Ontology for Domain-oriented Semantic Similarity Search on XML Data
Abstract: Query languages for XML such as XPath or XQuery support Boolean retrieval where a query result is a (possibly restructured) subset of XML elements or entire documents tha...
Anja Theobald
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
15 years 9 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
CIKM
2008
Springer
15 years 6 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
121
Voted
CSDA
2006
100views more  CSDA 2006»
15 years 4 months ago
Identification of interaction patterns and classification with applications to microarray data
Emerging patterns represent a class of interaction structures which has been recently proposed as a tool in data mining. In this paper, a new and more general definition refering ...
Anne-Laure Boulesteix, Gerhard Tutz
IANDC
2006
77views more  IANDC 2006»
15 years 4 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank