11211 search results - page 423 / 2243 » Rank-Sensitive Data Structures |
189
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
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 ...
154
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
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...
153
click to vote
CSDA
2006
15 years 6 months ago
2006
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 ...
172
click to vote
IANDC
2006
15 years 6 months ago
2006
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...
170
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper, we introduce the use of nonlinear dimension reduction for the analysis of functional neuroimaging datasets. Using a Laplacian Embedding approach, we show the power ...