Results 271 to 280 of about 4,856,518 (315)
Some of the next articles are maybe not open access.
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
Interpolation for data structures
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, 2006Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to control-dominated applications because of a lack of algorithms for computing interpolants for data structures used in software programs.
Deepak Kapur +2 more
openaire +1 more source
Communications of the ACM, 2011
Google's Web Tables and Deep Web Crawler identify and deliver this otherwise inaccessible resource directly to end users.
Michael J. Cafarella +2 more
openaire +1 more source
Google's Web Tables and Deep Web Crawler identify and deliver this otherwise inaccessible resource directly to end users.
Michael J. Cafarella +2 more
openaire +1 more source
Biochimie, 1982
260 sequences of tRNA are compared, after their classification into six categories: prokaryotic (83 sequences) and eukaryotic (83 sequences) elongators, prokaryotic (10 sequences) and eukaryotic (11 sequences), initiators, lower eukaryotic mitochondrial tRNA (53 sequences) and archaebacterial tRNA (20 sequences).
Grosjean, Henri +2 more
openaire +3 more sources
260 sequences of tRNA are compared, after their classification into six categories: prokaryotic (83 sequences) and eukaryotic (83 sequences) elongators, prokaryotic (10 sequences) and eukaryotic (11 sequences), initiators, lower eukaryotic mitochondrial tRNA (53 sequences) and archaebacterial tRNA (20 sequences).
Grosjean, Henri +2 more
openaire +3 more sources
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
Data structures are an important component of efficient and well-structured programs. In shared memory distributed computing, correct data structures are difficult to construct because concurrent accesses by different processes can conflict with one another. One simple approach is to use a global lock to restrict access to one process at a time.
Faith Ellen, Trevor Brown 0001
openaire +1 more source
Data structures are an important component of efficient and well-structured programs. In shared memory distributed computing, correct data structures are difficult to construct because concurrent accesses by different processes can conflict with one another. One simple approach is to use a global lock to restrict access to one process at a time.
Faith Ellen, Trevor Brown 0001
openaire +1 more source