Results 221 to 230 of about 2,861,627 (269)
Some of the next articles are maybe not open access.
1990
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques.
Mehlhorn, Kurt, Tsakalidis, A.
openaire +3 more sources
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques.
Mehlhorn, Kurt, Tsakalidis, A.
openaire +3 more sources
ACM Transactions on Algorithms, 2007
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present, but also in the past. In this new paradigm, called retroactive data structures , the historical sequence of operations performed on the data structure is not fixed. The data structure allows
Erik D. Demaine +2 more
openaire +5 more sources
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present, but also in the past. In this new paradigm, called retroactive data structures , the historical sequence of operations performed on the data structure is not fixed. The data structure allows
Erik D. Demaine +2 more
openaire +5 more sources
The structure of “data structures”
Proceedings of the ACM '81 conference on - ACM 81, 1981A data structure is defined to be a 4-tuple D, F, S, A>. D and F are Domain and Function definitions which define the externally observable behavior; S and A are a Storage Structure and Algorithms which implement the functions. It is shown that this definition helps organize the field of data structures for presentation to students.
openaire +1 more source
SIAM Journal on Computing, 1988
We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data-structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries.
Richard M. Karp +2 more
openaire +1 more source
We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data-structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries.
Richard M. Karp +2 more
openaire +1 more source
WICCAP: from semi-structured data to structured data
Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004., 2004Web data extraction is a technique for extracting and integrating data from Web based semistructured data. Wrappers function like the kernel of Web data extraction systems providing information mediator between users and a large number of heterogeneous data sources.
Zhao Li, Wee Keong Ng
openaire +1 more source
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness! This includes lower bounds for: (a) high-dimensional problems, where the goal is to show large space lower bounds; (b) constant-dimensional geometric problems, where the ...
openaire +1 more source
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness! This includes lower bounds for: (a) high-dimensional problems, where the goal is to show large space lower bounds; (b) constant-dimensional geometric problems, where the ...
openaire +1 more source
Data integration approach for semi-structured and structured data (Linked Data)
2015 IEEE 13th International Conference on Industrial Informatics (INDIN), 2015Researchers in the semantic web community have been designing tools and architectures to integrate heterogeneous data originated from distributed sources in the last decade. Technologies, such as RDF, have enabled new data spaces and concept descriptors to define an increasing complex and heterogeneous web of data. To these growing data resource spaces
Mohamed Salah Kettouch +3 more
openaire +1 more source
Experimenting with data structures
Software: Practice and Experience, 1986AbstractResearch in robust data structures can be done both by theoretical analysis of properties of abstract implementations and by empirical study of real implementations. Empirical study requires a support environment for the actual implementation.
David J. Taylor, James P. Black
openaire +1 more source
2017 IEEE European Symposium on Security and Privacy (EuroS&P), 2017
The classic notion of history-independence guarantees that if a data structure is ever observed, only its current contents are revealed, not the history of operations that built it. This powerful concept has applications, for example, to e-voting and data retention compliance, where data structure histories should be private.
Michael T. Goodrich +3 more
openaire +2 more sources
The classic notion of history-independence guarantees that if a data structure is ever observed, only its current contents are revealed, not the history of operations that built it. This powerful concept has applications, for example, to e-voting and data retention compliance, where data structure histories should be private.
Michael T. Goodrich +3 more
openaire +2 more sources
On the dynamization of data structures
BIT, 1988We present a simple dynamization method that preserves the query and storage costs of a static data structure and ensures reasonable update costs. In this method, the majority of data elements are maintained in a single data structure, and the updates are handled using ``smaller'' auxiliary data structures.
Nageswara S. V. Rao +2 more
openaire +1 more source