Sciweavers

232 search results - page 32 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
CATS
2008
15 years 5 days ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 11 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
COORDINATION
2004
Springer
15 years 4 months ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
PROMISE
2010
14 years 5 months ago
Replication of defect prediction studies: problems, pitfalls and recommendations
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
Thilo Mende
BMCBI
2007
123views more  BMCBI 2007»
14 years 10 months ago
BIRCH: A user-oriented, locally-customizable, bioinformatics system
Background: Molecular biologists need sophisticated analytical tools which often demand extensive computational resources. While finding, installing, and using these tools can be ...
Brian Fristensky