Results 261 to 270 of about 225,922 (311)

Advancements in Data Structures and Algorithms

openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Algorithm and Data Structure

2021
Now that we’ve discussed computer hardware and how to program it to achieve desired purpose, we will discuss how to make programs efficient by leveraging well-known algorithms and data structures for managing logic and data, respectively.
Paul D. Crutcher, Peter Tiegs, Neeraj Kumar Singh   +2 more
openaire   +2 more sources

Data Structures and Simple Algorithms

2016
This chapter and the three that follow it concern continuous random variables. We have chosen to present continuous random variables first because they are defined with a somewhat simpler data structure than that for discrete random variables. The development described here gives a probabilist the ability to automate the instantiation and processing of
Diane L. Evans, John H. Drew, Lawrence M. Leemis, Andrew G. Glen   +3 more
openaire   +2 more sources

Data Structures and Algorithms

1997
Niklaus Wirth, the creator of Pascal, Modula-2, and more recently, Oberon, once wrote a book entitled Data Structures + Algorithms = Programs. A key idea of that book is that data structures and algorithms must work together to produce a result. Further, the thesis is proposed that data structures and algorithms must be developed together, and, using ...
openaire   +2 more sources

Array structures and data-parallel algorithms

1996
We integrate the semantics of higher-order functional programs with a notion of explicit static processes as used in BSP and PRAM algorithms. The result is the construction of a cartesian closed category (CCC), a model for typed functional languages. Concrete data structures (CDS) yield many useful CCC and Brookes and Geva have generalised (gCDS) and ...
Hains, Gaétan, Mullins, John
openaire   +3 more sources

Resilient Algorithms and Data Structures

2010
Modern memory devices may suffer from faults, where some bits may arbitrarily flip and corrupt the values of the affected memory cells. The appearance of such faults may seriously compromise the correctness and performance of computations. In recent years, many algorithms for computing in the presence of memory faults have been introduced in the ...
openaire   +3 more sources

Algorithms and Data Structures

2004
Much of the following discussion in this work relies on standard tools from computational geometry,approximationtheory,and computer programming. For the reader’s convenience, relevant material concerning required algorithms and data structures is composed in this chapter, which helps to keep this work widely self-contained.
openaire   +2 more sources

Data structures and algorithms for topological analysis

2014 Science and Information Conference, 2014
One of the steps of geometric modeling is to know the topology and/or the geometry of the objects considered. This paper presents different data structures and algorithms used in this study. We are particularly interested by algebraic structures, eg homotopy and homology groups, the Betti numbers, the Euler characteristic, or the Morse-Smale complex ...
Cane, Jean-Marc, Tzoumas, George, Michelucci, Dominique, Hidalgo, Marta, Sebti, Foufou   +4 more
openaire   +3 more sources

Patterns for decoupling data structures and algorithms

ACM SIGCSE Bulletin, 1999
In order to build a data structure that is extensible and reusable, it is necessary to decouple the intrinsic and primitive behavior of the structure from the application specific behavior that manipulates it. To illustrate such a construction, this paper proposes a uniform object-oriented structural pattern for recursive data structures, and shows how
Stephen B. Wong, Dung (“Zung”) Nguyen   +1 more
openaire   +2 more sources