Sciweavers

569 search results - page 96 / 114
» High Performance Reasoning with Very Large Knowledge Bases
Sort
View
HPCA
2005
IEEE
15 years 10 months ago
Unbounded Transactional Memory
Hardware transactional memory should support unbounded transactions: transactions of arbitrary size and duration. We describe a hardware implementation of unbounded transactional ...
C. Scott Ananian, Krste Asanovic, Bradley C. Kuszm...
CIKM
2011
Springer
13 years 9 months ago
LogSig: generating system events from raw textual logs
Modern computing systems generate large amounts of log data. System administrators or domain experts utilize the log data to understand and optimize system behaviors. Most system ...
Liang Tang, Tao Li, Chang-Shing Perng
RTAS
2010
IEEE
14 years 8 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
BMCBI
2010
125views more  BMCBI 2010»
14 years 9 months ago
In-silico prediction of blood-secretory human proteins using a ranking algorithm
Background: Computational identification of blood-secretory proteins, especially proteins with differentially expressed genes in diseased tissues, can provide highly useful inform...
Qi Liu, Juan Cui, Qiang Yang, Ying Xu