Sciweavers

232 search results - page 46 / 47
» Or-Parallelism within Tabling
Sort
View
USENIX
2003
13 years 7 months ago
Operating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
Keir Faser, Fay Chang
BMCBI
2008
142views more  BMCBI 2008»
13 years 5 months ago
Genetic weighted k-means algorithm for clustering large-scale gene expression data
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
Fang-Xiang Wu
CGF
2008
124views more  CGF 2008»
13 years 5 months ago
Fast Soft Self-Shadowing on Dynamic Height Fields
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
John Snyder, Derek Nowrouzezahrai
ALMOB
2006
135views more  ALMOB 2006»
13 years 5 months ago
P-value based visualization of codon usage data
Two important and not yet solved problems in bacterial genome research are the identification of horizontally transferred genes and the prediction of gene expression levels. Both ...
Peter Meinicke, Thomas Brodag, Wolfgang Florian Fr...
MST
2006
136views more  MST 2006»
13 years 5 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl