Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
71
Sweeping Lines and Line Segments with a Heap
, 1997
"... Given n line segments in the plane, the Bentley-Ottmann sweep maintains the exact ordering of the intersections of the segments with a vertical line, as this line sweeps the plane from left to right. To accomplish this, every intersection between two segments must be processed, and the running time ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
of the sweep can be (n 2). In this paper, it is shown how a heap on the intersections can be maintained during the sweep. This new type of sweep processes O(n log² n)intersections when sweeping over lines and O(n p n log n) intersections when sweeping over line segments. Alower bound of (n log n) is also
An Efficient Parallel Heap Compaction Algorithm
"... ABSTRACT We propose a heap compaction algorithm appropriate for modern computing environments. Our algorithm is targeted at SMP platforms. It demonstrates high scalability when running in parallel but is also extremely efficient when running single-threaded on a uniprocessor. Instead of using the st ..."
Abstract
- Add to MetaCart
achieves (almost) perfect compaction in the lower addresses of the heap, whereas previous algorithms achieved parallelism by compacting within several predetermined segments. Next, we investigate a method that trades compaction quality for a further reduction in time and space overhead. Finally, we propose
An Efficient Parallel Heap Compaction Algorithm
- In ACM Conference on Programming Language Design and Implementation
, 2004
"... We propose a heap compaction algorithm appropriate for modern computing environments. Our algorithm is targeted at SMP platforms. It demonstrates high scalability when running in parallel but is also extremely ecient when running single-threaded on a uniprocessor. Instead of using the standard forwa ..."
Abstract
- Add to MetaCart
(almost) perfect compaction in the lower addresses of the heap, whereas previous algorithms achieved parallelism by compacting within several predetermined segments. Next, we investigate a method that trades compaction quality for a further reduction in time and space overhead. Finally, we propose a
Segment Order Preserving and Generational Garbage Collection for Prolog
"... We treat two important issues in heap garbage collection for WAM-based Prolog systems. First we describe a new method for preserving the order of heap segments in a copying garbage collector. Second, we deal with methods for (multi-)generational garbage collection; in particular we show the importan ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
We treat two important issues in heap garbage collection for WAM-based Prolog systems. First we describe a new method for preserving the order of heap segments in a copying garbage collector. Second, we deal with methods for (multi-)generational garbage collection; in particular we show
Separation Logic + Superposition Calculus = Heap Theorem Prover
- PLDI'11
, 2011
"... Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising foundation for dealing with heap manipulating programs, while the development of practical automated deduction/satisfiabi ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising foundation for dealing with heap manipulating programs, while the development of practical automated deduction
Improving the Accuracy and Performance of Memory Communication Through Renaming
- in 30th Annual International Symposium on Microarchitecture
, 1997
"... As processors continue to exploit more instruction level parallelism, a greater demand is placed on reducing the effects of memory access latency. In this paper, we introduce a novel modification of the processor pipeline called memory renaming. Memory renaming applies register access techniques to ..."
Abstract
-
Cited by 101 (5 self)
- Add to MetaCart
%. Furthermore, this improvement is seen across all memory segments -- including the heap segment...
Heap Memory Management in Prolog with Tabling: Principles and Practice
- J. of Functional and Logic Programm
, 2001
"... We address memory management aspects of WAM-based logic programming systems that support tabled evaluation through the use of a suspension/resumption mechanism. We describe the memory organization and usefulness logic of such systems, and issues that have to be resolved for effective and efficient g ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
garbage collection. Special attention is given to early reset in the context of suspended computations and to what is involved in the implementation of a segment order preserving copying collector for a tabled Prolog system. We also report our experience from building two working heap garbage collectors
AntHeaps: A New Hybrid Image Segmentation Algorithm using Ant Colonies
"... During the last few years, the Segmentation problem has been tackled from different disciplines. Many algorithms have been developed to solve this problem. AntClust algorithm is an antbased algorithm that uses the self-organizing and autonomous brood sorting behavior observed in real ants for unsupe ..."
Abstract
- Add to MetaCart
During the last few years, the Segmentation problem has been tackled from different disciplines. Many algorithms have been developed to solve this problem. AntClust algorithm is an antbased algorithm that uses the self-organizing and autonomous brood sorting behavior observed in real ants
Novel transformation techniques using q-heaps with applications to computational geometry
- SIAM Journal of Computing
"... Abstract. Using the notions of Q-heaps and fusion trees developed by Fredman and Willard, we develop general transformation techniques to reduce a number of computational geometry problems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading tec ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. Using the notions of Q-heaps and fusion trees developed by Fredman and Willard, we develop general transformation techniques to reduce a number of computational geometry problems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading
From Vision to Action: Grasping Unmodeled Objects from a Heap
, 1995
"... We have investigated the problem of removing objects from a heap without having recourse to object models. This capability is useful for "intelligent singulation", i.e., the decomposition of a heap into isolated objects. As we are exclusively relying on geometric information, the use of ra ..."
Abstract
- Add to MetaCart
We have investigated the problem of removing objects from a heap without having recourse to object models. This capability is useful for "intelligent singulation", i.e., the decomposition of a heap into isolated objects. As we are exclusively relying on geometric information, the use
Results 1 - 10
of
71
