Sciweavers

11212 search results - page 156 / 2243
» Semi-persistent Data Structures
Sort
View
155
Voted
IPPS
2010
IEEE
15 years 16 days ago
Structuring the execution of OpenMP applications for multicore architectures
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
François Broquedis, Olivier Aumage, Brice G...
102
Voted
APPML
2002
58views more  APPML 2002»
15 years 2 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
113
Voted
ICSE
1999
IEEE-ACM
15 years 7 months ago
Identifying Objects Using Cluster and Concept Analysis
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...
Arie van Deursen, Tobias Kuipers
146
Voted
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 2 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
100
Voted
CGF
2002
116views more  CGF 2002»
15 years 2 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal