Sciweavers

9325 search results - page 281 / 1865
» The decentralized implementability problem
Sort
View
EUROSYS
2006
ACM
16 years 1 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
ASIAN
2004
Springer
117views Algorithms» more  ASIAN 2004»
15 years 9 months ago
The Feature Selection and Intrusion Detection Problems
Cyber security is a serious global concern. The potential of cyber terrorism has posed a threat to national security; meanwhile the increasing prevalence of malware and incidents o...
Andrew H. Sung, Srinivas Mukkamala
BICOB
2010
Springer
15 years 9 months ago
A Grid-Enabled Problem Solving Environment for QTL Analysis in R
We present a grid-enabled problem solving environment (PSE), for multidimensional QTL analysis. The concept of a computational grid has not been fully realized within this and oth...
Mahen Jayawardena, Carl Nettelblad, Salman Zubair ...
BMCBI
2008
125views more  BMCBI 2008»
15 years 4 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
SADM
2008
178views more  SADM 2008»
15 years 3 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon