Sciweavers

2186 search results - page 70 / 438
» Considering an Organization's Memory
Sort
View
WECWIS
2007
IEEE
135views ECommerce» more  WECWIS 2007»
14 years 3 months ago
Large Scale Web Service Discovery and Composition using High Performance In-Memory Indexing
With the growing number and ubiquitous usage of Web services throughout the service-oriented community, the need to find service descriptions in a given repository, as well as co...
Lukasz Juszczyk, Anton Michlmayr, Christian Platze...
LCPC
2005
Springer
14 years 2 months ago
Applying Data Copy to Improve Memory Performance of General Array Computations
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
Qing Yi
SBBD
2004
114views Database» more  SBBD 2004»
13 years 10 months ago
On Coding Navigation Paths for In-Memory Navigation in Persistent Object Stores
We consider matrix index and navigation index approaches to in-memory navigation of persistent object stores. We demonstrate that both approaches can be re-formulated independentl...
Markus Kirchberg, Klaus-Dieter Schewe, Alexei Tret...
ASPDAC
2004
ACM
129views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Instruction buffering exploration for low energy VLIWs with instruction clusters
— For multimedia applications, loop buffering is an efficient mechanism to reduce the power in the instruction memory of embedded processors. In particular, software controlled ...
Tom Vander Aa, Murali Jayapala, Francisco Barat, G...
IJFCS
2002
122views more  IJFCS 2002»
13 years 8 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers