Sciweavers

82 search results - page 10 / 17
» An Improved Competitive Algorithm for Reordering Buffer Mana...
Sort
View
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 1 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
JSS
2007
121views more  JSS 2007»
13 years 7 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
ISCA
2012
IEEE
279views Hardware» more  ISCA 2012»
11 years 9 months ago
Staged memory scheduling: Achieving high performance and scalability in heterogeneous systems
When multiple processor (CPU) cores and a GPU integrated together on the same chip share the off-chip main memory, requests from the GPU can heavily interfere with requests from t...
Rachata Ausavarungnirun, Kevin Kai-Wei Chang, Lava...
SIGGRAPH
1997
ACM
13 years 11 months ago
Rendering complex scenes with memory-coherent ray tracing
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
Matt Pharr, Craig E. Kolb, Reid Gershbein, Pat Han...
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 7 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan