Sciweavers

3238 search results - page 580 / 648
» Not Enough Points Is Enough
Sort
View
DSN
2006
IEEE
13 years 11 months ago
Efficiently Detecting All Dangling Pointer Uses in Production Servers
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...
Dinakar Dhurjati, Vikram S. Adve
ER
2006
Springer
158views Database» more  ER 2006»
13 years 11 months ago
Database to Semantic Web Mapping Using RDF Query Languages
One of the main drawbacks of the Semantic Web is the lack of semantically rich data, since most of the information is still stored in relational databases. In this paper, we presen...
Cristian Pérez de Laborda, Stefan Conrad
EUC
2006
Springer
13 years 11 months ago
Write Back Routine for JFFS2 Efficient I/O
Abstract. When flash memory is used as a storage in embedded systems, block level translation layer is required between conventional filesystem and flash memory chips due to its ph...
Seung Ho Lim, Sung Hoon Baek, Joo Young Hwang, Kyu...
FPGA
2006
ACM
90views FPGA» more  FPGA 2006»
13 years 11 months ago
Improving performance and robustness of domain-specific CPLDs
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...
Mark Holland, Scott Hauck
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
13 years 11 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...