Sciweavers

65 search results - page 1 / 13
» Recursion Versus Iteration with the List as a Data Structure
Sort
View
IIE
2007
56views more  IIE 2007»
13 years 4 months ago
Recursion Versus Iteration with the List as a Data Structure
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
Izabella Foltynowicz
ISCIS
2005
Springer
13 years 10 months ago
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
Margarida Mamede
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 8 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
ASPDAC
2009
ACM
109views Hardware» more  ASPDAC 2009»
13 years 6 months ago
Soft lists: a native index structure for NOR-flash-based embedded devices
Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices w...
Li-Pin Chang, Chen-Hui Hsu
CTCS
1987
Springer
13 years 8 months ago
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...
Tatsuya Hagino