Results 351 to 360 of about 37,788,190 (381)
Some of the next articles are maybe not open access.
1982
So far, we have given each variable an individual name. This is impractical, if many variables are necessary that are treated in the same way and are of the same type, such as, for example, if a table of data is to be constructed. In this case, we wish to give the entire set of data a name and to denote individual elements with an identifying number, a
openaire +2 more sources
So far, we have given each variable an individual name. This is impractical, if many variables are necessary that are treated in the same way and are of the same type, such as, for example, if a table of data is to be constructed. In this case, we wish to give the entire set of data a name and to denote individual elements with an identifying number, a
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Structural signatures for tree data structures
Proceedings of the VLDB Endowment, 2008Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in XML documents), it is crucial that integrity and confidentiality be ...
Kundu, Ashish, Bertino, Elisa
openaire +3 more sources
Techniques for Designing and Analyzing Algorithms, 2021
Michael Ball, Gerald Friedland
semanticscholar +1 more source
Michael Ball, Gerald Friedland
semanticscholar +1 more source
Structured data in structural analysis software
26th Structures, Structural Dynamics, and Materials Conference, 1985This paper discusses the use of computer data structures in finite-element structural analysis programs. A number of data structure types that have been shown to be useful in such programs are introduced and described. A simple finite-element model is used to demonstrate how the given set of data structure types naturally lend themselves to developing ...
Donald L. Kunz, A.Stewart Hopkins
openaire +3 more sources
Data Structures, Program Structures
2018At the beginning of July 1975 I left Rome with my wife and my three children, respectively 4 years, 2 years and 8 months old. Destination Ithaca. The house had been lent to us by a colleague of the Computer Science Department of Cornell University and was on the outskirts of Ithaca, uphill.
openaire +2 more sources
2017
In the next sections, we will cover the database model employed by force.com, how to configure security for your data, how to generate data without code, and how to query that data using the Developer Console. In order to perform the queries, we will also cover force.com’s query languages. Grab a good cup of coffee or tea as this chapter is mostly text,
openaire +2 more sources
In the next sections, we will cover the database model employed by force.com, how to configure security for your data, how to generate data without code, and how to query that data using the Developer Console. In order to perform the queries, we will also cover force.com’s query languages. Grab a good cup of coffee or tea as this chapter is mostly text,
openaire +2 more sources
Genetic Algorithms + Data Structures = Evolution Programs
Springer Berlin Heidelberg, 1996Z. Michalewicz
semanticscholar +1 more source
From data structure to process structure [PDF]
, 1992 This paper deals with transformations in a process algebraic formalism that has been extended with an abstract data type language. We show how for a well-known class of processes (bags, queues, stacks, etc.) descriptions in terms of simple process definitions and complex state parameters can be transformed in a stepwise fashion into equivalent systems ...
openaire +1 more source