11211 search results - page 2146 / 2243 » Data Structures |
107
click to vote
DAGSTUHL
2007
14 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
MBEES
2010
14 years 11 months ago
2010
: Integrating architectural elements with a modern programming language is essential to ensure a smooth combination of architectural design and programming. In this position statem...
85
Voted
DBA
2004
2004
A Tool for Transforming Conceptual Schemas of Spatio-Temporal Databases with Multiple Representation
14 years 11 months ago
Nowadays, classical conceptual models (such as ER or UML) are used for designing database applications. These classical conceptual models usually come with associated CASE tools a...
80
Voted
GEOINFO
2003
14 years 11 months ago
2003
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data struc...
USS
2004
14 years 11 months ago
2004
Buffer overflow exploits make use of the treatment of strings in C as character arrays rather than as first-class objects. Manipulation of arrays as pointers and primitive pointer...