Sciweavers

992 search results - page 96 / 199
» Dependencies to Optimize Ontology Based Data Access
Sort
View
MICRO
1997
IEEE
110views Hardware» more  MICRO 1997»
15 years 5 months ago
The Design and Performance of a Conflict-Avoiding Cache
High performance architectures depend heavily on efficient multi-level memory hierarchies to minimize the cost of accessing data. This dependence will increase with the expected i...
Nigel P. Topham, Antonio González, Jos&eacu...
CONEXT
2007
ACM
15 years 5 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav
ICCL
1998
IEEE
15 years 6 months ago
Loop Optimization for Aggregate Array Computations
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
Yanhong A. Liu, Scott D. Stoller
ERCIMDL
2000
Springer
140views Education» more  ERCIMDL 2000»
15 years 5 months ago
Associative and Spatial Relationships in Thesaurus-Based Retrieval
The OASIS (Ontologically Augmented Spatial Information System) project explores terminology systems for thematic and spatial access in digital library applications. A prototype im...
Harith Alani, Christopher B. Jones, Douglas Tudhop...
TPDS
2002
126views more  TPDS 2002»
15 years 1 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma