Sciweavers

927 search results - page 60 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
111
Voted
ISCC
2006
IEEE
129views Communications» more  ISCC 2006»
15 years 6 months ago
A Semantic Overlay Network for P2P Schema-Based Data Integration
Abstract— Today data sources are pervasive and their number is growing tremendously. Current tools are not prepared to exploit this unprecedented amount of information and to cop...
Carmela Comito, Simon Patarin, Domenico Talia
140
Voted
DAWAK
2005
Springer
15 years 6 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
92
Voted
IANDC
2006
77views more  IANDC 2006»
15 years 18 days 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
96
Voted
BIRTHDAY
2009
Springer
15 years 1 months ago
An ASM-Characterization of a Class of Distributed Algorithms
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
Andreas Glausch, Wolfgang Reisig
IJHPCA
2007
114views more  IJHPCA 2007»
15 years 15 days ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima