Sciweavers

286 search results - page 45 / 58
» Cache Remapping to Improve the Performance of Tiled Algorith...
Sort
View
ICDT
2005
ACM
124views Database» more  ICDT 2005»
14 years 1 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
COOPIS
1999
IEEE
14 years 23 days ago
Selectively Materializing Data in Mediators by Analyzing User Queries
There is currently great interest in building information mediators that can integrate informationfrom multipledata sources such as databases or Web sources. The query response ti...
Naveen Ashish, Craig A. Knoblock, Cyrus Shahabi
CF
2005
ACM
13 years 10 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 1 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
14 years 3 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt