Sciweavers

1681 search results - page 3 / 337
» A Framework for Analysis of Data Freshness
Sort
View
PLDI
1990
ACM
13 years 10 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 1 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han
PPOPP
2012
ACM
12 years 1 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ERCIMDL
2010
Springer
162views Education» more  ERCIMDL 2010»
13 years 7 months ago
Citation Graph Based Ranking in Invenio
Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that comple...
Ludmila Marian, Jean-Yves LeMeur, Martin Rajman, M...
SCOPES
2004
Springer
13 years 11 months ago
An Automated C++ Code and Data Partitioning Framework for Data Management of Data-Intensive Applications
An automated framework for code and data partitioning for the needs of data management is presented. The goal is to identify the main data types from the data management perspectiv...
Athanasios Milidonis, Grigoris Dimitroulakos, Mich...