Sciweavers

280 search results - page 53 / 56
» Binary Matrix Factorization with Applications
Sort
View
HPDC
2006
IEEE
14 years 1 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
CIKM
2005
Springer
14 years 27 days ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 27 days ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
BioSAVE: Display of scored annotation within a sequence context
Background: Visualization of sequence annotation is a common feature in many bioinformatics tools. For many applications it is desirable to restrict the display of such annotation...
Richard F. Pollock, Boris Adryan
MST
2010
146views more  MST 2010»
13 years 2 months ago
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
Rezaul Alam Chowdhury, Vijaya Ramachandran