Sciweavers

11212 search results - page 190 / 2243
» Semi-persistent Data Structures
Sort
View
APPINF
2003
15 years 7 months ago
A Comparison of Structure-generic Relational Storage Schemes of XML Data
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
Weining Zhang, Douglas Pollok
FOIKS
2010
Springer
15 years 4 months ago
Two Complementary Classification Methods for Designing a Concept Lattice from Interval Data
This paper holds on the application of two classification methods based on formal concept analysis (FCA) to interval data. The first method uses a similarity between objects while ...
Mehdi Kaytoue-Uberall, Zainab Assaghir, Nizar Mess...
IGARSS
2010
15 years 3 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
INFOCOM
2011
IEEE
14 years 9 months ago
Dynamic right-sizing for power-proportional data centers
—Power consumption imposes a significant cost for data centers implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of ...
Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, ...
CIKM
2008
Springer
15 years 8 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,...