Sciweavers

2254 search results - page 117 / 451
» Computing the minimal covering set
Sort
View
AMOST
2005
ACM
15 years 6 months ago
Test prioritization for pairwise interaction coverage
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
94
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 19 days ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 3 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
116
Voted
CLOUD
2010
ACM
15 years 5 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...
90
Voted
BMCBI
2010
112views more  BMCBI 2010»
15 years 27 days ago
In silico fragmentation for computer assisted identification of metabolite mass spectra
Background: Mass spectrometry has become the analytical method of choice in metabolomics research. The identification of unknown compounds is the main bottleneck. In addition to t...
Sebastian Wolf, Stephan Schmidt, Matthias Mül...