Sciweavers

11213 search results - page 97 / 2243
» Low-contention data structures
Sort
View
ICDM
2007
IEEE
199views Data Mining» more  ICDM 2007»
15 years 10 months ago
Discovering Structural Anomalies in Graph-Based Data
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder
JASIS
2008
125views more  JASIS 2008»
15 years 3 months ago
A tool for data cube construction from structurally heterogeneous XML documents
Data cubes for OLAP (Online Analytical Processing) often need to be constructed from data located in several distributed and autonomous information sources. Such a data integratio...
Turkka Näppilä, Kalervo Järvelin, T...
132
Voted
FCCM
2000
IEEE
144views VLSI» more  FCCM 2000»
15 years 8 months ago
Automatic Synthesis of Data Storage and Control Structures for FPGA-Based Computing Engines
Mapping computations written in high-level programming languages to FPGA-based computing engines requires programmers to generate the datapath responsible for the core of the comp...
Pedro C. Diniz, Joonseok Park
152
Voted
ICICS
2007
Springer
15 years 7 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
105
Voted
DRM
2007
Springer
15 years 10 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....