Sciweavers

1096 search results - page 28 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
DCC
2008
IEEE
15 years 9 months ago
An Approach to Graph and Netlist Compression
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
Jeehong Yang, Serap A. Savari, Oskar Mencer
IPPS
2010
IEEE
14 years 7 months ago
Hybrid MPI/Pthreads parallelization of the RAxML phylogenetics code
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...
Wayne Pfeiffer, Alexandros Stamatakis
DAGSTUHL
1997
14 years 11 months ago
InVIS - Interactive Visualization of Medical Data Sets
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
Jörg Meyer, Steffen Gelder, Timna E. Schneide...
ICALP
2009
Springer
15 years 10 months ago
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Ka...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
15 years 10 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...